A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
From MaRDI portal
Publication:4504779
DOI10.1080/10556789908805750zbMath0957.90129OpenAlexW1981027849WikidataQ126241694 ScholiaQ126241694MaRDI QIDQ4504779
Publication date: 2 April 2001
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556789908805750
interior-point methodspolynomial-time algorithmsEuclidean Jordan algebraprimal-dual path-following algorithmshomogeneous and self-dual cone programmingsecond-order cone programming problems
Related Items
An inexact smoothing method for SOCCPs based on a one-parametric class of smoothing function, Jordan-algebraic aspects of optimization: randomization, A New Iteration Large-Update Primal-Dual Interior-Point Method for Second-Order Cone Programming, A damped Gauss-Newton method for the second-order cone complementarity problem, A regularized smoothing Newton method for solving SOCCPs based on a new smoothing C-function, Two classes of merit functions for the second-order cone complementarity problem, Second-order cone programming approaches to static shakedown analysis in steel plasticity, A two-parametric class of merit functions for the second-order cone complementarity problem, Polynomial convergence of second-order mehrotra-type predictor-corrector algorithms over symmetric cones, Polynomial complexity of an interior point algorithm with a second order corrector step for symmetric cone programming, A proximal point algorithm for the monotone second-order cone complementarity problem, A smoothing Newton method with Fischer-Burmeister function for second-order cone complementarity problems, Some useful inequalities via trace function method in Euclidean Jordan algebras, Round-off estimates for second-order conic feasibility problems, An extension of Chubanov's algorithm to symmetric cones, A new interior-point algorithm based on modified Nesterov-Todd direction for symmetric cone linear complementarity problem, An extension of Chubanov's polynomial-time linear programming algorithm to second-order cone programming, The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction, On the generalized Fischer-Burmeister merit function for the second-order cone complementarity problem, Weak infeasibility in second order cone programming, Interior Point Methods for Nonlinear Optimization, Primal-dual interior-point algorithms for second-order cone optimization based on a new parametric kernel function, A descent method for a reformulation of the second-order cone complementarity problem, On local convergence of sequential quadratically-constrained quadratic-programming type methods, with an extension to variational problems, An iteration primal–dual path-following method, based on wide neighbourhood and large update, for second-order cone programming, Conditions for error bounds and bounded level sets of some merit functions for the second-order cone complementarity problem, A one-parametric class of merit functions for the second-order cone complementarity problem, The penalized Fischer-Burmeister SOC complementarity function, A merit function method for infinite-dimensional SOCCPs, On self-regular IPMs (with comments and rejoinder), Analysis of nonsmooth vector-valued functions associated with infinite-dimensional second-order cones, Two Classes of Merit Functions for Infinite-Dimensional Second Order Complimentary Problems, A semismooth Newton method for SOCCPs based on a one-parametric class of SOC complementarity functions, A note on treating a second order cone program as a special case of a semidefinite program, Interior proximal methods and central paths for convex second-order cone programming, A globally convergent non-interior point algorithm with full Newton step for second-order cone programming, Quadratic convergence to the optimal solution of second-order conic optimization without strict complementarity, A smoothing Newton algorithm for solving the monotone second-order cone complementarity problems, An Introduction to Formally Real Jordan Algebras and Their Applications in Optimization, On the Implementation and Usage of SDPT3 – A Matlab Software Package for Semidefinite-Quadratic-Linear Programming, Version 4.0, A primal-dual interior-point algorithm for second-order cone optimization with full Nesterov-Todd step, Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions, A large-update primal–dual interior-point algorithm for second-order cone optimization based on a new proximity function, A pivoting procedure for a class of second-order cone programming, Implementation of infinite-dimensional interior-point method for solving multi-criteria linear-quadratic control problem, Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP, Simplex-type algorithm for second-order cone programmes via semi-infinite programming reformulation, A new complementarity function and applications in stochastic second-order cone complementarity problems, A feasible direction algorithm for nonlinear second-order cone programs, Similarity and other spectral relations for symmetric cones, An Inexact Augmented Lagrangian Method for Second-Order Cone Programming with Applications, On the optimal parameter of a self-concordant barrier over a symmetric cone, An unconstrained smooth minimization reformulation of the second-order cone complementarity problem, On a commutative class of search directions for linear programming over symmetric cones
Cites Work
- Unnamed Item
- Applications of second-order cone programming
- A unified analysis for a class of long-step primal-dual path-following interior-point algorithms for semidefinite programming
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Euclidean Jordan algebras and interior-point algorithms
- Extension of Karmarkar's algorithm onto convex quadratically constrained quadratic problems
- On the convergence of the method of analytic centers when applied to convex quadratic programs
- Associative and Jordan Algebras, and Polynomial Time Interior-Point Algorithms for Symmetric Cones
- Interior-Point Methods for the Monotone Semidefinite Linear Complementarity Problem in Symmetric Matrices
- A method of Analytic Centers for Quadratically Constrained Convex Quadratic Programs
- Primal-Dual Interior-Point Methods for Semidefinite Programming: Convergence Rates, Stability and Numerical Results
- On the Nesterov--Todd Direction in Semidefinite Programming
- Optimal Truss Design by Interior-Point Methods
- Potential Reduction Polynomial Time Method for Truss Topology Design
- Self-Scaled Barriers and Interior-Point Methods for Convex Programming
- An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
- Primal--Dual Path-Following Algorithms for Semidefinite Programming
- Primal-Dual Interior-Point Methods for Self-Scaled Cones
- Polynomial Convergence of a New Family of Primal-Dual Algorithms for Semidefinite Programming
- An Interior-Point Method for Semidefinite Programming
