Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
From MaRDI portal
Publication:1591356
DOI10.1007/s101070000137zbMath0967.65077MaRDI QIDQ1591356
Renato D. C. Monteiro, Takashi Tsuchiya
Publication date: 20 December 2000
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
semidefinite programmingpolynomial convergencepredictor-corrector algorithmsecond-order cone programmingiteration-complexity boundsprimal-dual path-following algorithms
Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Nonlinear programming (90C30) Interior-point methods (90C51)
Related Items
An inexact smoothing method for SOCCPs based on a one-parametric class of smoothing function, The modulus-based matrix splitting iteration methods for second-order cone linear complementarity problems, A damped Gauss-Newton method for the second-order cone complementarity problem, Quadratically constraint quadratical algorithm model for nonlinear minimax problems, Continuous multifacility ordered median location problems, Primal Newton method for the linear cone programming problem, A regularized smoothing Newton method for solving SOCCPs based on a new smoothing C-function, An approximate lower order penalty approach for solving second-order cone linear complementarity problems, An alternating direction method for second-order conic programming, Two classes of merit functions for the second-order cone complementarity problem, Computational strategy for Russell measure in DEA: second-order cone programming, The matrix splitting iteration method for nonlinear complementarity problems associated with second-order cone, An alternating direction method for convex quadratic second-order cone programming with bounded constraints, A two-parametric class of merit functions for the second-order cone complementarity problem, A method combining norm-relaxed QCQP subproblems with active set identification for inequality constrained optimization, A full Nesterov-Todd step infeasible interior-point method for second-order cone optimization, Second-order cone programming with warm start for elastoplastic analysis with von Mises yield criterion, The dual simplex-type method for linear second-order cone programming problem, A variant of the affine-scaling method for a second-order cone program, 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, The relaxation modulus-based matrix splitting iteration methods for circular cone nonlinear complementarity problems, An extension of Chubanov's algorithm to symmetric cones, The solution set structure of monotone linear complementarity problems over second-order cone, A working set SQCQP algorithm with simple nonmonotone penalty parameters, Generalized lower-order penalty algorithm for solving second-order cone mixed complementarity problems, Extension of the LP-Newton method to conic programming problems via semi-infinite representation, An SQP-type algorithm for nonlinear second-order cone programs, A power penalty method for second-order cone nonlinear complementarity problems, 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, Two new predictor-corrector algorithms 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, Analysis of nonsmooth vector-valued functions associated with infinite-dimensional second-order cones, 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, A new one-step smoothing Newton method for second-order cone programming., Conditions for error bounds of linear complementarity problems over second-order cones with pseudomonotonicity, A power penalty method for second-order cone linear complementarity problems, Covering problems with polyellipsoids: a location analysis perspective, Alternate solution approaches for competitive hub location problems, 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, Optimal Risk Transfer: A Numerical Optimization Approach, A one-parametric class of smoothing functions for second-order cone programming, 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, A modified LM algorithm for tensor complementarity problems over the circular cone, Primal-dual interior-point algorithms for second-order cone optimization based on kernel functions, The Mothership and Drone Routing Problem, A new complementarity function and applications in stochastic second-order cone complementarity problems, A feasible direction algorithm for nonlinear second-order cone programs, A sequential quadratically constrained quadratic programming method for unconstrained minimax problems, Sequential quadratically constrained quadratic programming norm-relaxed algorithm of strongly sub-feasible directions, An Inexact Augmented Lagrangian Method for Second-Order Cone Programming with Applications, An unconstrained smooth minimization reformulation of the second-order cone complementarity problem, An efficient support vector machine learning method with second-order cone programming for large-scale problems, On a commutative class of search directions for linear programming over symmetric cones
