✦ LIBER ✦

Solving cone-constrained convex programs by differential inclusions

✍ Scribed by Sjur D. Flåm; Alberto Seeger

Publisher: Springer-Verlag
Year: 1994
Tongue: English
Weight: 806 KB
Volume: 65
Category: Article
ISSN: 0025-5610
DOI: 10.1007/bf01581692

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linearly constrained convex programming

Linearly constrained convex programming as unconstrained differentiable concave programming

✍ P. Tseng 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 208 KB

Convex relaxations for nonconvex quadrat

Convex relaxations for nonconvex quadratically constrained quadratic programming: matrix cone decomposition and polyhedral approximation

✍ Xiao Jin Zheng; Xiao Ling Sun; Duan Li 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 321 KB

Solving inequality constrained optimizat

Solving inequality constrained optimization problems by differential homotopy continuation methods

✍ Masao Fukushima 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 502 KB

Solving convex quadratic programming by

Solving convex quadratic programming by potential-reduction interior-point algorithm

✍ Liang Xi-ming; Ma Long-hua; Qian Ji-xin 📂 Article 📅 2001 🏛 SP Zhejiang University Press 🌐 English ⚖ 354 KB

Solving convex programs with infinitely

Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method

✍ Soon-Yi Wu; S.-C. Fang 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 541 KB

One of the major computational bottlenecks of using the conventional cutting plane approach to solve convex programming problems with infinitely many linear constraints lies in finding a global optimizer of a nonlinear and nonconvex program. This paper presents a relaxed scheme to generate a new cut

A stress-constrained truss-topology and

A stress-constrained truss-topology and material-selection problem that can be solved by linear programming

✍ M. Stolpe; K. Svanberg 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 333 KB