Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds

DOI10.1007/S10957-008-9422-2MaRDI QIDQ1014028zbMATH OpenOpenAlexWikidataFDO

Authors R. C. M. Silva, J. X. da Cruz Neto, O. P. Ferreira, P. R. Oliveira

Publication date 24 April 2009

Published in Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10957-008-9422-2

zbMATH Keywords

Riemannian manifoldssemidefinite programmingcentral pathCauchy trajectorygeneralized proximal-point methods

Mathematics Subject Classification ID

Convex programming (90C25) Semidefinite programming (90C22)

Recommendations

• Central Paths, Generalized Proximal Point Methods, and Cauchy Trajectories in Riemannian Manifolds
• On the central paths and Cauchy trajectories in semidefinite programming
• Interior Point Trajectories in Semidefinite Programming
• Analyticity of the central path at the boundary point in semidefinite programming
• THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS

Cites work

• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• A class of polynomial variable metric algorithms for linear optimization
• An Interior Proximal Algorithm and the Exponential Multiplier Method for Semidefinite Programming
• Central Paths, Generalized Proximal Point Methods, and Cauchy Trajectories in Riemannian Manifolds
• Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
• Hessian Riemannian Gradient Flows in Convex Programming
• Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
• Limiting behavior of the central path in semidefinite optimization
• Monotone Operators and the Proximal Point Algorithm
• Multi-parameter surfaces of analytic centers and long-step surface-following interior point methods
• Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
• On some properties of generalized proximal point methods for variational inequalities
• On the Convergence of the Central Path in Semidefinite Optimization
• On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
• Proximal Point Algorithm On Riemannian Manifolds
• Semidefinite optimization
• Smooth nonlinear optimization of \(\mathbb R^n\)
• THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS

Cited in

(8)

• On a special class of regularized central paths for semidefinite programs
• A new barrier for a class of semidefinite problems
• An incremental subgradient method on Riemannian manifolds
• Interior proximal methods and central paths for convex second-order cone programming
• On the central paths and Cauchy trajectories in semidefinite programming
• On the central paths in symmetric cone programming
• Controlled dual perturbations for central path trajectories in geometric programming
• On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization

This page was built for publication: Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014028)