Self-regular functions and new search directions for linear and semidefinite optimization

DOI10.1007/S101070200296zbMath1007.90037OpenAlexW2112079301WikidataQ60608935 ScholiaQ60608935MaRDI QIDQ1849264

Cornelis Roos, Jiming Peng, Tamás Terlaky

Publication date: 1 December 2002

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s101070200296

zbMATH Keywords

interior-point methodprimal-dual methodsemidefinite optimizationlinear optimizationpolynomial complexityself-regularity

Mathematics Subject Classification ID

Linear programming (90C05)

Related Items (only showing first 100 items - show all)

A primal-dual interior-point algorithm for symmetric optimization based on a new kernel function with trigonometric barrier term yielding the best known iteration bounds ⋮ Interior-point methods based on kernel functions for symmetric optimization ⋮ A new infeasible interior-point algorithm with full step for linear optimization based on a simple function ⋮ A FULL NT-STEP INFEASIBLE INTERIOR-POINT ALGORITHM FOR SEMIDEFINITE OPTIMIZATION BASED ON A SELF-REGULAR PROXIMITY ⋮ A wide neighborhood interior-point algorithm with arc-search for \(P_{\ast}(\kappa)\) linear complementarity problem ⋮ A full-step interior-point algorithm for linear complementarity problem based on a simple function ⋮ Polynomial interior-point algorithm for \(P_\ast(\kappa)\) horizontal linear complementarity problems ⋮ A method for weighted projections to the positive definite cone ⋮ A full-Newton step infeasible interior-point algorithm for linear programming based on a kernel function ⋮ Complexity analysis and numerical implementation of large-update interior-point methods for SDLCP based on a new parametric barrier kernel function ⋮ An infeasible interior-point algorithm with full-Newton steps for \(P_*(\kappa)\) horizontal linear complementarity problems based on a kernel function ⋮ A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints ⋮ A NEW POLYNOMIAL INTERIOR-POINT ALGORITHM FOR THE MONOTONE LINEAR COMPLEMENTARITY PROBLEM OVER SYMMETRIC CONES WITH FULL NT-STEPS ⋮ A new large-update interior point algorithm for \(P_{*}(\kappa)\) LCPs based on kernel functions ⋮ A corrector–predictor path-following algorithm for semidefinite optimization ⋮ A second-order Mehrotra-type predictor-corrector algorithm with a new wide neighbourhood for semi-definite programming ⋮ A polynomial interior-point algorithm for monotone linear complementarity problems ⋮ A class of new large-update primal-dual interior-point algorithms for \(P_\ast(\kappa)\) nonlinear complementarity problems ⋮ Kernel-function-based primal-dual interior-point methods for convex quadratic optimization over symmetric cone ⋮ A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization ⋮ A kernel function based interior-point methods for solving \(P_{*}(\kappa )\)-linear complementarity problem ⋮ A class of polynomial interior-point algorithms for the Cartesian \(P_{*}(\kappa )\) second-order cone linear complementarity problem ⋮ An infeasible interior-point algorithm for monotone linear complementarity problem based on a specific kernel function ⋮ New complexity analysis for primal-dual interior-point methods for self-scaled optimization problems ⋮ A large-update feasible interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function ⋮ A full-Newton step \(O(n)\) infeasible-interior-point algorithm for linear complementarity problems ⋮ A large-update interior-point algorithm for convex quadratic semi-definite optimization based on a new kernel function ⋮ A full-Newton step infeasible interior-point algorithm for \(P_\ast (\kappa)\) linear complementarity problem ⋮ The accuracy of interior-point methods based on kernel functions ⋮ Complexity analysis and numerical implementation of primal-dual interior-point methods for convex quadratic optimization based on a finite barrier ⋮ A new second-order corrector interior-point algorithm for semidefinite programming ⋮ Complexity analysis of interior point methods for linear programming based on a parameterized kernel function ⋮ A new parameterized kernel function for LO yielding the best known iteration bound for a large-update interior point algorithm ⋮ A new proximity function generating the best known iteration bounds for both large-update and small-update interior-point methods ⋮ Simplified infeasible interior-point algorithm for SDO using full Nesterov-Todd step ⋮ A class of polynomial interior point algorithms for the Cartesian P-matrix linear complementarity problem over symmetric cones ⋮ A new interior-point algorithm for \(P_{\ast}(k)\)-NCP based on a class of parametric kernel functions ⋮ A full-NT-step infeasible interior-point algorithm for SDP based on kernel functions ⋮ On complexity analysis of the primal-dual interior-point method for semidefinite optimization problem based on a new proximity function ⋮ A new kind of simple kennel function yielding good iteration bounds for primal-dual interior-point methods ⋮ A unified kernel function approach to primal-dual interior-point algorithms for convex quadratic SDO ⋮ New complexity analysis of interior-point methods for the Cartesian \(P_\ast ({\kappa})\)-SCLCP ⋮ A primal-dual large-update interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new class of kernel functions ⋮ A full-Newton step interior-point algorithm for linear optimization based on a finite barrier ⋮ Interior-point algorithms for \(P_{*}(\kappa )\)-LCP based on a new class of kernel functions ⋮ General primal-dual penalty/barrier path-following Newton methods for nonlinear programming ⋮ Primal-dual interior-point algorithm for convex quadratic semi-definite optimization ⋮ Complexity analysis of primal-dual interior-point methods for linear optimization based on a new parametric kernel function with a trigonometric barrier term ⋮ Full-NT step infeasible interior-point method for SOCO based on a specific kernel function ⋮ A PRIMAL-DUAL INTERIOR-POINT ALGORITHM BASED ON A NEW KERNEL FUNCTION ⋮ A generic interior-point algorithm for monotone symmetric cone linear complementarity problems based on a new kernel function ⋮ A large-update interior-point method for Cartesian \(P_{\ast}(\kappa)\)-LCP over symmetric cones ⋮ Complexity analysis of infeasible interior-point method for semidefinite optimization based on a new trigonometric kernel function ⋮ Complexity of large-update interior point algorithm for \(P_{*}(\kappa )\) linear complementarity problems ⋮ New complexity analysis of IIPMs for linear optimization based on a specific self-regular function ⋮ \(\mathcal{UV}\)-theory of a class of semidefinite programming and its applications ⋮ An interior-point algorithm for \(P_*(\kappa)\)-LCP based on a new trigonometric kernel function with a double barrier term ⋮ A new primal-dual interior-point method for semidefinite optimization based on a parameterized kernel function ⋮ An adaptive infeasible-interior-point method with the one-norm wide neighborhood for semi-definite programming ⋮ New parameterized kernel functions for linear optimization ⋮ Primal-dual interior-point algorithm for semidefinite optimization based on a new kernel function with trigonometric barrier term ⋮ A new large-update interior point algorithm for \(P_*(\kappa )\) linear complementarity problems ⋮ On self-regular IPMs (with comments and rejoinder) ⋮ Complexity analysis of interior-point methods for linear optimization based on some conditions on kernel function ⋮ A full-Newton step infeasible interior-point algorithm based on darvay directions for linear optimization ⋮ Complexity analysis of an interior point algorithm for the semidefinite optimization based on a kernel function with a double barrier term ⋮ Polynomial-time interior-point algorithm based on a local self-concordant finite barrier function ⋮ An efficient parameterized logarithmic kernel function for semidefinite optimization ⋮ An interior-point algorithm for linear optimization based on a new barrier function ⋮ Kernel-function Based Primal-Dual Algorithms forP_*(κ) Linear Complementarity Problems ⋮ A Polynomial-time Interior-point Algorithm for Convex Quadratic Semidefinite Optimization ⋮ The complexity of self-regular proximity based infeasible IPMs ⋮ Interior proximal methods and central paths for convex second-order cone programming ⋮ A wide neighbourhood interior-point method with iteration-complexity bound for semidefinite programming ⋮ Polynomial interior-point algorithms for \(P_*(\kappa )\) horizontal linear complementarity problem ⋮ Self-Regular Interior-Point Methods for Semidefinite Optimization ⋮ Exploring complexity of large update interior-point methods for \(P_*(\kappa )\) linear complementarity problem based on kernel function ⋮ Primal-dual interior-point algorithms with dynamic step-size based on kernel functions for linear programming ⋮ 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 ⋮ A full-Newton step infeasible interior-point method for linear optimization based on a trigonometric kernel function ⋮ An adaptive infeasible interior-point algorithm for linear complementarity problems ⋮ Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions ⋮ A class of large-update and small-update primal-dual interior-point algorithms for linear optimization ⋮ A new primal-dual path-following interior-point algorithm for semidefinite optimization ⋮ A new full-Newton step interior-point method for \(P_*(\kappa)\)-LCP based on a positive-asymptotic kernel function ⋮ AN INTERIOR POINT APPROACH FOR SEMIDEFINITE OPTIMIZATION USING NEW PROXIMITY FUNCTIONS ⋮ A primal-dual interior point method for \(P_{\ast}\left(\kappa \right)\)-HLCP based on a class of parametric kernel functions ⋮ A full-Newton step feasible interior-point algorithm for monotone horizontal linear complementarity problems ⋮ Research Article: On Extending Primal-Dual Interior-Point Method for Linear Optimization to Convex Quadratic Symmetric Cone Optimization ⋮ Improving complexity of structured convex optimization problems using self-concordant barriers ⋮ An infeasible primal-dual interior point algorithm for linear programs based on logarithmic equivalent transformation ⋮ Primal-dual interior-point algorithms for semidefinite optimization based on a simple kernel function ⋮ New complexity analysis of a Mehrotra-type predictor–corrector algorithm for semidefinite programming ⋮ Complexity analysis of primal-dual interior-point methods for semidefinite optimization based on a parametric kernel function with a trigonometric barrier term ⋮ Novel kernel function with a hyperbolic barrier term to primal-dual interior point algorithm for SDP problems ⋮ A predictor-corrector algorithm for \(P_{\ast}(\kappa)\)-linear complementarity problems based on a specific self-regular proximity function ⋮ Several matrix trace inequalities on Hermitian and skew-Hermitian matrices ⋮ Large-update interior point algorithm for \(P_*\)-linear complementarity problem ⋮ A class of path-following interior-point methods for \(P_*(\kappa)\)-horizontal linear complementarity problems

This page was built for publication: Self-regular functions and new search directions for linear and semidefinite optimization