Pages that link to "Item:Q1404230"

The following pages link to Extension of primal-dual interior point algorithms to symmetric cones (Q1404230):

Displaying 50 items.

• Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming (Q2817246) (← links)
• A predictor-corrector infeasible-interior-point method for the Cartesian -LCP over symmetric cones with iteration complexity (Q2836103) (← links)
• Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization (Q2841915) (← links)
• An inexact smoothing method for the monotone complementarity problem over symmetric cones (Q2885490) (← links)
• Interior-point methods based on kernel functions for symmetric optimization (Q2885493) (← links)
• A New Iteration Large-Update Primal-Dual Interior-Point Method for Second-Order Cone Programming (Q2895672) (← links)
• A new polynomial interior-point algorithm for the monotone linear complementarity problem over symmetric cones with full NT-steps (Q2911579) (← links)
• A corrector–predictor path-following method for second-order cone optimization (Q2958275) (← links)
• An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones (Q2970393) (← links)
• A Corrector-Predictor Interior-Point Algorithm for <i>P</i>_∗(<i>κ</i>)-HLCPs Over Cartesian Product of Symmetric Cones (Q2987781) (← links)
• On the Lorentz Cone Complementarity Problems in Infinite-Dimensional Real Hilbert Space (Q3016308) (← links)
• The Cauchy interlacing theorem in simple Euclidean Jordan algebras and some consequences (Q3082854) (← links)
• Jordan-algebraic aspects of optimization: randomization (Q3161141) (← links)
• A primal–dual predictor–corrector interior-point method for symmetric cone programming with O(√r log <i>ϵ</i>⁻¹) iteration complexity (Q3174878) (← links)
• Properties of a Class of Nonlinear Transformations Over Euclidean Jordan Algebras with Applications to Complementarity Problems (Q3184202) (← links)
• A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization (Q3188450) (← links)
• SOME PROPERTIES OF A CLASS OF MERIT FUNCTIONS FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS (Q3421861) (← links)
• A method for weighted projections to the positive definite cone (Q3453401) (← links)
• A Lipschitzian error bound for monotone symmetric cone linear complementarity problem (Q3453409) (← links)
• Several Jordan-algebraic aspects of optimization† (Q3507703) (← links)
• VECTOR-VALUED IMPLICIT LAGRANGIAN FOR SYMMETRIC CONE COMPLEMENTARITY PROBLEMS (Q3636501) (← links)
• Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones (Q4559409) (← links)
• (Q4604968) (← links)
• New Interior-Point Algorithm for Symmetric Optimization Based on a Positive-Asymptotic Barrier Function (Q4622797) (← links)
• A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization (Q4622888) (← links)
• A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs (Q4639138) (← links)
• A long-step interior-point algorithm for symmetric cone Cartesian <i>P</i>_*(κ)-HLCP (Q4646542) (← links)
• Extension of primal-dual interior point methods to diff-convex problems on symmetric cones (Q4916325) (← links)
• An Arc Search Interior-Point Algorithm for Monotone Linear Complementarity Problems over Symmetric Cones (Q4959371) (← links)
• Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the Cartesian<b><i>P</i></b>_*(κ)-LCP Over Symmetric Cones (Q4979787) (← links)
• New complexity analysis of full Nesterov-Todd step infeasible interior point method for second-order cone optimization (Q4987772) (← links)
• Infeasible path-following interior point algorithm for Cartesian <i>P</i>_*(κ) nonlinear complementarity problems over symmetric cones (Q5026485) (← links)
• Infeasible Mehrotra-type predictor–corrector algorithm for cartesian <i>P</i>_*(κ) nonlinear complementarity problems over symmetric cones (Q5031768) (← 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)
• An algorithm for nonsymmetric conic optimization inspired by MOSEK (Q5043851) (← links)
• An O(r(cond(G))1/4log¼ϵ−1) iteration predictor–corrector interior-point method with a new one-norm neighbourhood for symmetric cone optimization (Q5045166) (← links)
• A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming (Q5058407) (← links)
• Condition Number Minimization in Euclidean Jordan Algebras (Q5072593) (← links)
• A new full-NT step interior-point method for circular cone optimization (Q5147630) (← links)
• An iteration primal–dual path-following method, based on wide neighbourhood and large update, for second-order cone programming (Q5169450) (← links)
• Interior-point methods for Cartesian<i>P</i>_*(κ)-linear complementarity problems over symmetric cones based on the eligible kernel functions (Q5200563) (← links)
• A Full-NT Step Infeasible Interior-Point Algorithm for Mixed Symmetric Cone LCPs (Q5241637) (← links)
• Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the Cartesian<i>P</i>_∗(κ)-LCP over symmetric cones (Q5248204) (← links)
• Full Nesterov–Todd step feasible interior-point method for the Cartesian<i>P</i>_*(κ)-SCLCP (Q5299915) (← links)
• A full-step interior-point algorithm for second-order cone optimization based on a simple locally kernel function (Q5299916) (← links)
• The Jordan algebraic structure of the circular cone (Q5346599) (← links)
• STEIN LINEAR PROGRAMS OVER SYMMETRIC CONES (Q5396052) (← links)
• (Q5409921) (← links)
• Implementation of infinite-dimensional interior-point method for solving multi-criteria linear-quadratic control problem (Q5478873) (← links)
• A primal-dual interior-point algorithm for symmetric optimization based on a new method for finding search directions (Q5745170) (← links)