On implementation of a self-dual embedding method for convex programming
From MaRDI portal
Publication:3377974
DOI10.1080/10556780500065317zbMath1181.90219OpenAlexW2054684836MaRDI QIDQ3377974
Johnny Tak Wai Cheng, Shu-Zhong Zhang
Publication date: 29 March 2006
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780500065317
Numerical mathematical programming methods (65K05) Convex programming (90C25) Interior-point methods (90C51)
Cites Work
- A new self-dual embedding method for convex programming
- A computational study of the homogeneous algorithm for large-scale convex optimization
- On a homogeneous algorithm for the monotone complementarity problem
- A simplified homogeneous and self-dual linear programming algorithm and its implementation
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Conic convex programming and self-dual embedding
- Averaged Subgradient Methods for Constrained Convex Optimization and Nash Equilibria Computation
- A note on Fermat's problem
This page was built for publication: On implementation of a self-dual embedding method for convex programming