✦ LIBER ✦

Self-Concordant Barriers for Convex Approximations of Structured Convex Sets

✍ Scribed by Levent Tunçel; Arkadi Nemirovski

Book ID: 106297262
Publisher: Springer-Verlag
Year: 2010
Tongue: English
Weight: 818 KB
Volume: 10
Category: Article
ISSN: 1615-3375
DOI: 10.1007/s10208-010-9069-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Geometry of homogeneous convex cones, du

Geometry of homogeneous convex cones, duality mapping, and optimal self-concordant barriers

✍ Van Anh Truong; Levent Tunçel 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 198 KB

A Lagrangian Dual Method with Self-Conco

A Lagrangian Dual Method with Self-Concordant Barriers for Multi-Stage Stochastic Convex Programming

✍ Gongyun Zhao 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 200 KB

A sufficient condition for self-concorda

A sufficient condition for self-concordance, with application to some classes of structured convex programming problems

✍ D. den Hertog; F. Jarre; C. Roos; T. Terlaky 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 712 KB

An outer approximation method for minimi

An outer approximation method for minimizing the product of several convex functions on a convex set

✍ Takahito Kuno; Yasutoshi Yajima; Hiroshi Konno 📂 Article 📅 1993 🏛 Springer US 🌐 English ⚖ 458 KB

A modification of convex approximation m

A modification of convex approximation methods for structural optimization

✍ Wei-Hong Zhang; C. Fleury 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 624 KB

Ah&act--The most popular convex approximation methods used today in structural optimization are discussed in this paper: the convex linearization method (CONLIN), the method of the moving asymptotes (MMA) and the sequential quadratic programming method (SQP). Modifications are made to enhance the re

Necessary and sufficient conditions for

Necessary and sufficient conditions for a compact convex set to be a set of best approximations

✍ Peter Lindstrom 📂 Article 📅 1970 🏛 Elsevier Science 🌐 English ⚖ 445 KB