✦ LIBER ✦

Hidden Convex Minimization

✍ Scribed by Duan Li; Zhi-You Wu; Heung-Wing Joseph Lee; Xin-Min Yang; Lian-Sheng Zhang

Publisher: Springer US
Year: 2005
Tongue: English
Weight: 411 KB
Volume: 31
Category: Article
ISSN: 0925-5001
DOI: 10.1007/s10898-004-5697-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Convex composite minimization withC1,1fu

Convex composite minimization withC1,1functions

✍ V. Jeyakumar; X. Q. Yang 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 671 KB

Convex minimization under Lipschitz cons

Convex minimization under Lipschitz constraints

✍ P. T. Thach 📂 Article 📅 1990 🏛 Springer 🌐 English ⚖ 957 KB

Concave minimization over a convex polyh

Concave minimization over a convex polyhedron

✍ Hamdy A. Taha 📂 Article 📅 1973 🏛 John Wiley and Sons 🌐 English ⚖ 781 KB

Optimal methods of smooth convex minimiz

Optimal methods of smooth convex minimization

✍ A.S. Nemirovskii; Yu.E. Nesterov 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 779 KB

Minimization of an M-convex function

✍ Akiyoshi Shioura 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 343 KB

We study the minimization of an M-convex function introduced by Murota. It is shown that any vector in the domain can be easily separated from a minimizer of the function. Based on this property, we develop a polynomial time algorithm.

A VU-algorithm for convex minimization

✍ Robert Mifflin; Claudia Sagastizábal 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 278 KB

For convex minimization we introduce an algorithm based on VU-space decomposition. The method uses a bundle subroutine to generate a sequence of approximate proximal points. When a primal-dual track leading to a solution and zero subgradient pair exists, these points approximate the primal track poi