Central paths in semidefinite programming, generalized proximal-point method and Cauchy trajectories in Riemannian manifolds
DOI10.1007/S10957-008-9422-2zbMATH Open1194.90068OpenAlexW1981652825WikidataQ115382589 ScholiaQ115382589MaRDI QIDQ1014028FDOQ1014028
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
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
Riemannian manifoldssemidefinite programmingcentral pathCauchy trajectorygeneralized proximal-point methods
Cites Work
- Smooth nonlinear optimization of \(\mathbb R^n\)
- Title not available (Why is that?)
- Monotone Operators and the Proximal Point Algorithm
- On the Riemannian geometry defined by self-concordant barriers and interior-point methods.
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Semidefinite optimization
- Proximal Point Algorithm On Riemannian Manifolds
- On some properties of generalized proximal point methods for variational inequalities
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Hessian Riemannian Gradient Flows in Convex Programming
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- On the Convergence of the Central Path in Semidefinite Optimization
- Central Paths, Generalized Proximal Point Methods, and Cauchy Trajectories in Riemannian Manifolds
- A class of polynomial variable metric algorithms for linear optimization
- An Interior Proximal Algorithm and the Exponential Multiplier Method for Semidefinite Programming
- Limiting behavior of the central path in semidefinite optimization
- THE CENTRAL PATH IN SMOOTH CONVEX SEMIDEFINITE PROGRAMS
- Multi-parameter surfaces of analytic centers and long-step surface-following interior point methods
Cited In (8)
- A new barrier for a class of semidefinite problems
- On a special class of regularized central paths for semidefinite programs
- 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)
