Interior proximal methods and central paths for convex second-order cone programming
type: Item
instance of: scholarly article
title: Interior proximal methods and central paths for convex second-order cone programming
zbMATH Open document ID: 1279.90113
author: Shaohua Pan
author: Jein-Shan Chen
published in: Nonlinear Analysis. Theory, Methods \& Applications. Series A: Theory and Methods
publication date: 2010-09-10T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90C51
zbMATH DE Number: 5782231
zbMATH Keywords: convex second order cone optimization
zbMATH Keywords: interior proximal methods
zbMATH Keywords: convergence
zbMATH Keywords: central path
MaRDI profile type: Publication
full work available at URL: j.na.2010.06.079
OpenAlex ID: W2000764704
cites work: Q4321748
cites work: Second-order cone programming
cites work: Applications of second-order cone programming
cites work: On implementing a primal-dual interior-point method for conic quadratic optimization
cites work: Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
cites work: A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
cites work: Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
cites work: Smoothing functions for second-order-cone complementarity problems
cites work: A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
cites work: On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity
cites work: An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
cites work: Perturbation des méthodes d'optimisation. Applications
cites work: Monotone Operators and the Proximal Point Algorithm
cites work: An interior-proximal method for convex linearly constrained problems and its extension to variational inequalities
cites work: Interior Gradient and Proximal Methods for Convex and Conic Optimization
cites work: Proximal minimization algorithm with \(D\)-functions
cites work: Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
cites work: Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
cites work: Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
cites work: Entropic Proximal Mappings with Applications to Nonlinear Programming
cites work: Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds
cites work: On the Convergence of the Central Path in Semidefinite Optimization
cites work: Limiting behavior of the central path in semidefinite optimization
cites work: THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS
cites work: Central Paths, Generalized Proximal Point Methods, and Cauchy Trajectories in Riemannian Manifolds
cites work: A Class of Interior Proximal-Like Algorithms for Convex Second-Order Cone Programming
cites work: The convex and monotone functions associated with second-order cone
cites work: Some characterizations for SOC-monotone and SOC-convex functions
cites work: Q5638112
cites work: Self-regular functions and new search directions for linear and semidefinite optimization
cites work: Proximal-like algorithm using the quasi D-function for convex second-order cone programming
DOI: 10.1016/J.NA.2010.06.079
description: scientific article; zbMATH DE number 5782231