Interior proximal methods and central paths for convex second-order cone programming

DOI10.1016/j.na.2010.06.079zbMath1279.90113OpenAlexW2000764704MaRDI QIDQ992842

Shaohua Pan, Jein-Shan Chen

Publication date: 10 September 2010

Published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.na.2010.06.079

zbMATH Keywords

convergencecentral pathinterior proximal methodsconvex second order cone optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Linear programming (90C05) Interior-point methods (90C51)

Cites Work

• Unnamed Item
• Unnamed Item
• Proximal-like algorithm using the quasi D-function for convex second-order cone programming
• Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds
• Some characterizations for SOC-monotone and SOC-convex functions
• Applications of second-order cone programming
• Proximal minimization algorithm with \(D\)-functions
• Second-order cone programming
• On implementing a primal-dual interior-point method for conic quadratic optimization
• Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
• Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
• Self-regular functions and new search directions for linear and semidefinite optimization
• An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
• An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
• Smoothing Functions for Second-Order-Cone Complementarity Problems
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• The convex and monotone functions associated with second-order cone
• A Class of Interior Proximal-Like Algorithms for Convex Second-Order Cone Programming
• Entropic Proximal Mappings with Applications to Nonlinear Programming
• Monotone Operators and the Proximal Point Algorithm
• Perturbation des méthodes d'optimisation. Applications
• Central Paths, Generalized Proximal Point Methods, and Cauchy Trajectories in Riemannian Manifolds
• A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
• THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• On the Convergence of the Central Path in Semidefinite Optimization
• Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
• On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity
• Limiting behavior of the central path in semidefinite optimization
• A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
• Interior Gradient and Proximal Methods for Convex and Conic Optimization

This page was built for publication: Interior proximal methods and central paths for convex second-order cone programming