A new self-dual embedding method for convex programming
From MaRDI portal
Publication:557368
DOI10.1023/B:JOGO.0000047915.10754.a1zbMath1089.90043OpenAlexW1971785294MaRDI QIDQ557368
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
Related Items (7)
Embedding methods for semidefinite programming ⋮ Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming ⋮ Projection onto the exponential cone: a univariate root-finding problem ⋮ A \({\mathsf{D}}\)-induced duality and its applications ⋮ Penalized interior point approach for constrained nonlinear programming ⋮ Robust convex conic optimization in D-induced duality framework ⋮ On implementation of a self-dual embedding method for convex programming
Uses Software
This page was built for publication: A new self-dual embedding method for convex programming
