Interior proximal methods and central paths for convex second-order cone programming
From MaRDI portal
Publication:992842
DOI10.1016/J.NA.2010.06.079zbMATH Open1279.90113OpenAlexW2000764704MaRDI QIDQ992842FDOQ992842
Authors: 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
Recommendations
- A Class of Interior Proximal-Like Algorithms for Convex Second-Order Cone Programming
- Proximal methods in view of interior-point strategies
- Primal-Dual Interior-Point Methods for Second-Order Conic Optimization Based on Self-Regular Proximities
- Interior proximal algorithm with variable metric for second-order cone programming: applications to structural optimization and support vector machines
- Interior Proximal and Multiplier Methods Based on Second Order Homogeneous Kernels
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Self-regular functions and new search directions for linear and semidefinite optimization
- Monotone Operators and the Proximal Point Algorithm
- Applications of second-order cone programming
- Second-order cone programming
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- On implementing a primal-dual interior-point method for conic quadratic optimization
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Smoothing functions for second-order-cone complementarity problems
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- Proximal minimization algorithm with \(D\)-functions
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
- An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
- On the local convergence of semismooth Newton methods for linear and nonlinear second-order cone programs without strict complementarity
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- On the Convergence of the Central Path in Semidefinite Optimization
- The convex and monotone functions associated with second-order cone
- A Class of Interior Proximal-Like Algorithms for Convex Second-Order Cone Programming
- Central Paths, Generalized Proximal Point Methods, and Cauchy Trajectories in Riemannian Manifolds
- Some characterizations for SOC-monotone and SOC-convex functions
- Perturbation des méthodes d'optimisation. Applications
- Limiting behavior of the central path in semidefinite optimization
- Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds
- THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS
- Proximal-like algorithm using the quasi D-function for convex second-order cone programming
Cited In (8)
- Interior proximal algorithm with variable metric for second-order cone programming: applications to structural optimization and support vector machines
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- On central-path proximity measures in interior-point methods
- Proximal-like algorithm using the quasi D-function for convex second-order cone programming
- Interior point methods for second-order cone programming and OR applications
- A Class of Interior Proximal-Like Algorithms for Convex Second-Order Cone Programming
- A semi-distance associated with symmetric cone and a new proximal distance function on second-order cone
- Construction of proximal distances over symmetric cones
This page was built for publication: Interior proximal methods and central paths for convex second-order cone programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992842)
