Conic convex programming and self-dual embedding
From MaRDI portal
Recommendations
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- scientific article; zbMATH DE number 1489798
- A new self-dual embedding method for convex programming
- On implementation of a self-dual embedding method for convex programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
Cites work
- A simplified homogeneous and self-dual linear programming algorithm and its implementation
- An O(√nL)-Iteration Homogeneous and Self-Dual Linear Programming Algorithm
- Computational experience with a primal-dual interior point method for linear programming
- Convergence behavior of interior-point algorithms
- Convex Analysis
- scientific article; zbMATH DE number 1182578 (Why is no real title available?)
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- Linear Inequalities and Related Systems. (AM-38)
- On homogeneous and self-dual algorithms for LCP
- On homogeneous interrior-point algorithms for semidefinite programming
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- Semidefinite Programming
- Symmetric primal-dual path-following algorithms for semidefinite programming
Cited in
(40)- Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions
- New stopping criteria for detecting infeasibility in conic optimization
- Initialization in semidefinite programming via a self-dual skew-symmetric embedding
- The accuracy of interior-point methods based on kernel functions
- A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization
- Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems
- Conic programming: infeasibility certificates and projective geometry
- An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming
- Status determination by interior-point methods for convex optimization problems in domain-driven form
- Douglas-Rachford splitting and ADMM for pathological convex optimization
- A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs
- The strong conical hull intersection property for convex programming
- On the behavior of the homogeneous self-dual model for conic convex optimization
- A primal-dual decomposition algorithm for multistage stochastic convex programming
- Integrated inventory control and facility location decisions in a multi-echelon supply chain network with hubs
- Embedding methods for semidefinite programming
- Interior-point methods based on kernel functions for symmetric optimization
- Using interior-point methods within an outer approximation framework for mixed integer nonlinear programming
- RECIPES FOR BUILDING THE DUAL OF CONIC OPTIMIZATION PROBLEM
- On implementation of a self-dual embedding method for convex programming
- Interior Point Methods for Nonlinear Optimization
- scientific article; zbMATH DE number 1182578 (Why is no real title available?)
- A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization
- Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization
- Solving SDP completely with an interior point oracle
- Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function
- Interior-point methods for Cartesian \(P_{\ast}(\kappa)\)-linear complementarity problems over symmetric cones based on the eligible kernel functions
- Solving conic optimization problems via self-dual embedding and facial reduction: A unified approach
- Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions
- A new self-dual embedding method for convex programming
- Preprocessing and regularization for degenerate semidefinite programs
- Error bounds and singularity degree in semidefinite programming
- Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones
- New predictor-corrector algorithm for symmetric cone horizontal linear complementarity problems
- Interior-point algorithms with full Newton steps for nonsymmetric convex conic optimization
- Reflection-projection method for convex feasibility problems with an obtuse cone
- A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step
- A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization
- Space tensor conic programming
- Universal duality in conic convex optimization
This page was built for publication: Conic convex programming and self-dual embedding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4525130)
