On implementation of a self-dual embedding method for convex programming
From MaRDI portal
Publication:3377974
Recommendations
- A new self-dual embedding method for convex programming
- Conic convex programming and self-dual embedding
- An algorithm of simplex imbeddings in convex programming
- A new algorithm for solving self-dual linear optimization problems
- On a method of simplex embeddings in convex programming.
- Conic optimization via operator splitting and homogeneous self-dual embedding
- Convergence results for a self-dual regularization of convex problems
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Dual approach for a class of implicit convex optimization problems
Cites work
- A computational study of the homogeneous algorithm for large-scale convex optimization
- A new self-dual embedding method for convex programming
- A note on Fermat's problem
- A simplified homogeneous and self-dual linear programming algorithm and its implementation
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Averaged Subgradient Methods for Constrained Convex Optimization and Nash Equilibria Computation
- Conic convex programming and self-dual embedding
- On a homogeneous algorithm for the monotone complementarity problem
Cited in
(4)
This page was built for publication: On implementation of a 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 Q3377974)
