Pages that link to "Item:Q1599289"

The following pages link to On a commutative class of search directions for linear programming over symmetric cones (Q1599289):

Displaying 29 items.

• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones (Q306357) (← links)
• Information geometry and interior-point algorithms in semidefinite programs and symmetric cone programs (Q364723) (← links)
• New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems (Q383382) (← links)
• Curvature integrals and iteration complexities in SDP and symmetric cone programs (Q404518) (← links)
• A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones (Q415402) (← links)
• A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones (Q483262) (← links)
• Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization (Q493059) (← links)
• Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming (Q627455) (← links)
• Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones (Q650213) (← links)
• Feasibility and solvability of Lyapunov-type linear programming over symmetric cones (Q707872) (← links)
• Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras (Q875019) (← links)
• An extension of sums of squares relaxations to polynomial optimization problems over symmetric cones (Q879967) (← links)
• A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones (Q888311) (← links)
• A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization (Q905304) (← links)
• Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones (Q1043012) (← links)
• An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function (Q1048238) (← links)
• A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy (Q1681807) (← links)
• Matrix monotonicity and self-concordance: how to handle quantum entropy in optimization problems (Q1686542) (← links)
• An extension of Chubanov's algorithm to symmetric cones (Q1717223) (← links)
• A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones (Q1743538) (← links)
• A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization (Q1937023) (← links)
• A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization (Q2018491) (← links)
• A new infeasible interior-point method based on Darvay's technique for symmetric optimization (Q2449352) (← links)
• An efficient support vector machine learning method with second-order cone programming for large-scale problems (Q2576752) (← links)
• Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects (Q2802530) (← links)
• Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization (Q2841915) (← links)
• A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS (Q2911579) (← links)
• Jordan-algebraic aspects of optimization: randomization (Q3161141) (← links)
• Simultaneous diagonalization on simple Euclidean Jordan algebras and its applications (Q4807684) (← links)