Pages that link to "Item:Q4525130"

The following pages link to Conic convex programming and self-dual embedding (Q4525130):

Displaying 29 items.

• Integrated inventory control and facility location decisions in a multi-echelon supply chain network with hubs (Q264284) (← links)
• Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization (Q493059) (← links)
• Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones (Q650213) (← links)
• Reflection-projection method for convex feasibility problems with an obtuse cone (Q704736) (← links)
• A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step (Q734862) (← links)
• A new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimization (Q735073) (← links)
• Universal duality in conic convex optimization (Q868444) (← links)
• Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions (Q1012072) (← links)
• New stopping criteria for detecting infeasibility in conic optimization (Q1024728) (← links)
• The accuracy of interior-point methods based on kernel functions (Q1935292) (← links)
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization (Q1937023) (← links)
• Warmstarting the homogeneous and self-dual interior point method for linear and conic quadratic problems (Q1947198) (← links)
• An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming (Q1999885) (← links)
• Status determination by interior-point methods for convex optimization problems in domain-driven form (Q2149574) (← links)
• Douglas-Rachford splitting and ADMM for pathological convex optimization (Q2282817) (← links)
• A new use of Douglas-Rachford splitting for identifying infeasible, unbounded, and pathological conic programs (Q2316619) (← links)
• A primal-dual decomposition algorithm for multistage stochastic convex programming (Q2571003) (← links)
• Embedding methods for semidefinite programming (Q2885491) (← links)
• Interior-point methods based on kernel functions for symmetric optimization (Q2885493) (← links)
• Using Interior-Point Methods within an Outer Approximation Framework for Mixed Integer Nonlinear Programming (Q2897298) (← links)
• On implementation of a self-dual embedding method for convex programming (Q3377974) (← links)
• Interior Point Methods for Nonlinear Optimization (Q3569506) (← links)
• A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization (Q4622888) (← links)
• Solving SDP completely with an interior point oracle (Q4999336) (← links)
• Full Nesterov-Todd step feasible interior-point algorithm for symmetric cone horizontal linear complementarity problem based on a positive-asymptotic barrier function (Q5038177) (← links)
• Interior-point methods for Cartesian<i>P</i>_*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions (Q5200563) (← links)
• Interior-point methods for symmetric optimization based on a class of non-coercive kernel functions (Q5299914) (← links)
• Preprocessing and Regularization for Degenerate Semidefinite Programs (Q5746441) (← links)
• Error Bounds and Singularity Degree in Semidefinite Programming (Q5857289) (← links)