A new self-dual embedding method for convex programming

DOI10.1023/B:JOGO.0000047915.10754.A1zbMATH Open1089.90043OpenAlexW1971785294MaRDI QIDQ557368FDOQ557368

Authors: Shuzhong Zhang 

Publication date: 23 June 2005

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/b:jogo.0000047915.10754.a1

Recommendations

• Conic convex programming and self-dual embedding
• On implementation of a self-dual embedding method for convex programming
• Efficient methods for solving convex programming problems that apply the embedding of the admissible set into simplices
• Solving conic optimization problems via self-dual embedding and facial reduction: A unified approach
• Self-Scaled Barriers and Interior-Point Methods for Convex Programming

zbMATH Keywords

convex programmingconic constraintsself-concordant barrier functionsself-dual embedding

Mathematics Subject Classification ID

Convex programming (90C25) Interior-point methods (90C51)

Cited In (10)

• Robust convex conic optimization in D-induced duality framework
• A \({\mathsf{D}}\)-induced duality and its applications
• A penalized interior point approach for constrained nonlinear programming
• Projection onto the exponential cone: a univariate root-finding problem
• Embedding methods for semidefinite programming
• On the behavior of the homogeneous self-dual model for conic convex optimization
• On implementation of a self-dual embedding method for convex programming
• Solving conic optimization problems via self-dual embedding and facial reduction: A unified approach
• Conic convex programming and self-dual embedding
• Using interior-point methods within an outer approximation framework for mixed integer nonlinear programming

Uses Software

• SDPHA

This page was built for publication: A new self-dual embedding method for convex programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q557368)