Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones

DOI10.1137/040606557zbMath1131.90043OpenAlexW2022266190MaRDI QIDQ5470240

Bharath Rangarajan

Publication date: 30 May 2006

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/9282

zbMATH Keywords

semidefinite programmingEuclidean Jordan algebrassymmetric conesconic programminginfeasible-interior-point methods

Mathematics Subject Classification ID

Semidefinite programming (90C22) Convex programming (90C25) Linear programming (90C05) Interior-point methods (90C51) Complexity and performance of numerical algorithms (65Y20)

Related Items (73)

Infeasible Mehrotra-type predictor–corrector algorithm for cartesian P_*(κ) nonlinear complementarity problems over symmetric cones ⋮ An infeasible full NT-step interior point method for circular optimization ⋮ An arc-search infeasible-interior-point method for symmetric optimization in a wide neighborhood of the central path ⋮ A note on an inequality involving Jordan product in Euclidean Jordan algebras ⋮ A New Iteration Large-Update Primal-Dual Interior-Point Method for Second-Order Cone Programming ⋮ A Lie product type formula in Euclidean Jordan algebras ⋮ A new infeasible-interior-point algorithm based on wide neighborhoods for symmetric cone programming ⋮ A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for linear programming over symmetric cones ⋮ An arc-search infeasible interior-point algorithm for horizontal linear complementarity problem in the N∞− neighbourhood of the central path ⋮ Full Nesterov–Todd step feasible interior-point method for the CartesianP_*(κ)-SCLCP ⋮ A wide neighbourhood predictor–corrector infeasible-interior-point algorithm for symmetric cone programming ⋮ A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS ⋮ Polynomial convergence of Mehrotra-type prediction-corrector infeasible-IPM for symmetric optimization based on the commutative class directions ⋮ A New Second-Order Infeasible Primal-Dual Path-Following Algorithm for Symmetric Optimization ⋮ Iterative complexities of a class of homogeneous algorithms for monotone nonlinear complementarity problems over symmetric cones ⋮ A modified and simplified full Nesterov-Todd step \(\mathcal {O}(N)\) infeasible interior-point method for second-order cone optimization ⋮ A new infeasible-interior-point algorithm for linear programming over symmetric cones ⋮ Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras ⋮ A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization ⋮ A new wide neighborhood primal-dual infeasible-interior-point method for symmetric cone programming ⋮ A Mizuno-Todd-Ye predictor-corrector infeasible-interior-point method for symmetric optimization with the arc-search strategy ⋮ A wide neighborhood interior-point method for Cartesian \(P_*(\kappa )\)-LCP over symmetric cones ⋮ A new corrector-predictor interior-point method for symmetric cone optimization ⋮ An infeasible interior-point algorithm for stochastic second-order cone optimization ⋮ Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones ⋮ A new full Nesterov-Todd step primal-dual path-following interior-point algorithm for symmetric optimization ⋮ A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones ⋮ A Mehrotra-type second-order predictor–corrector algorithm for nonlinear complementarity problems over symmetric cones ⋮ Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming ⋮ Polynomial convergence of primal-dual path-following algorithms for symmetric cone programming based on wide neighborhoods and a new class of directions ⋮ A new full Nesterov-Todd step feasible interior-point method for convex quadratic symmetric cone optimization ⋮ Full Nesterov-Todd step infeasible interior-point method for symmetric optimization ⋮ An infeasible full-NT step IPM for horizontal linear complementarity problem over Cartesian product of symmetric cones ⋮ Kernel-based interior-point methods for monotone linear complementarity problems over symmetric cones ⋮ A long-step feasible predictor–corrector interior-point algorithm for symmetric cone optimization ⋮ A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem ⋮ A new infeasible interior-point method based on Darvay's technique for symmetric optimization ⋮ A weighted-path-following method for symmetric cone linear complementarity problems ⋮ Large-neighborhood infeasible predictor-corrector algorithm for horizontal linear complementarity problems over Cartesian product of symmetric cones ⋮ An arc search infeasible interior-point algorithm for symmetric optimization using a new wide neighborhood ⋮ A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function ⋮ A new strategy in the complexity analysis of an infeasible-interior-point method for symmetric cone programming ⋮ Improved complexity analysis of full Nesterov-Todd step feasible interior-point method for symmetric optimization ⋮ A wide neighborhood infeasible-interior-point method with arc-search for -SCLCPs ⋮ A new infeasible Mehrotra-type predictor-corrector algorithm for nonlinear complementarity problems over symmetric cones ⋮ An infeasible full-NT step interior point algorithm for CQSCO ⋮ A long-step interior-point algorithm for symmetric cone Cartesian P_*(κ)-HLCP ⋮ A polynomial primal-dual affine scaling algorithm for symmetric conic optimization ⋮ Z-transformations on proper and symmetric cones ⋮ An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming ⋮ Lyapunov-type least-squares problems over symmetric cones ⋮ Logarithmic barrier decomposition-based interior point methods for stochastic symmetric programming ⋮ Interior point method on semi-definite linear complementarity problems using the Nesterov-Todd (NT) search direction: polynomial complexity and local convergence ⋮ Feasibility and solvability of Lyapunov-type linear programming over symmetric cones ⋮ A smoothing-type Newton method for second-order cone programming problems based on a new smooth function ⋮ A Mehrotra-type predictor-corrector infeasible-interior-point method with a new one-norm neighborhood for symmetric optimization ⋮ A full Nesterov–Todd step infeasible-interior-point algorithm for CartesianP_*(κ) horizontal linear complementarity problems over symmetric cones ⋮ A globally convergent non-interior point algorithm with full Newton step for second-order cone programming ⋮ Complementarity Problems Over Symmetric Cones: A Survey of Recent Developments in Several Aspects ⋮ A new smoothing Newton-type method for second-order cone programming problems ⋮ An Arc Search Interior-Point Algorithm for Monotone Linear Complementarity Problems over Symmetric Cones ⋮ An infeasible interior-point algorithm based on modified Nesterov and Todd directions for symmetric linear complementarity problem ⋮ A full Nesterov-Todd step feasible weighted primal-dual interior-point algorithm for symmetric optimization ⋮ Infeasible Mehrotra-Type Predictor-Corrector Interior-Point Algorithm for the CartesianP_*(κ)-LCP Over Symmetric Cones ⋮ A corrector-predictor arc search interior-point algorithm for symmetric optimization ⋮ Unnamed Item ⋮ A primal-dual interior-point algorithm for symmetric cone convex quadratic programming based on the commutative class directions ⋮ Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization ⋮ Path-following interior point algorithms for the Cartesian \(P_{*}(\kappa )\)-LCP over symmetric cones ⋮ An \(O(rL)\) infeasible interior-point algorithm for symmetric cone LCP via CHKS function ⋮ Polynomial convergence of Mehrotra-type predictor–corrector algorithm for the CartesianP_∗(κ)-LCP over symmetric cones ⋮ Unnamed Item ⋮ Infeasible path-following interior point algorithm for Cartesian P_*(κ) nonlinear complementarity problems over symmetric cones

This page was built for publication: Polynomial Convergence of Infeasible-Interior-Point Methods over Symmetric Cones