On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization
From MaRDI portal
Publication:1037353
DOI10.1007/s10898-008-9367-xzbMath1205.90216OpenAlexW2171961288MaRDI QIDQ1037353
R. C. M. Silva, Orizon P. Ferreira, Paulo Roberto Oliveira
Publication date: 16 November 2009
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-008-9367-x
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the convergence of the exponential multiplier method for convex programming
- Penalty and barrier methods for convex semidefinite programming
- A unified approach to interior point algorithms for linear complementarity problems: A summary
- Asymptotic analysis of the exponential penalty trajectory in linear programming
- Nonlinear rescaling and proximal-like methods in convex optimization
- Geometry of subanalytic and semialgebraic sets
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Asymptotic behavior of the central path for a special class of degenerate SDP problems
- On Dual Convergence of the Generalized Proximal Point Method with Bregman Distances
- Semidefinite optimization
- A new barrier for a class of semidefinite problems
- Matrix Analysis
- An Interior Proximal Algorithm and the Exponential Multiplier Method for Semidefinite Programming
- Central Paths, Generalized Proximal Point Methods, and Cauchy Trajectories in Riemannian Manifolds
- The convergence of a modified barrier method for convex programming
- Penalty/Barrier multiplier algorthm for semidefinit programming∗
- On the Convergence of the Central Path in Semidefinite Optimization
- Some Convergence Properties of the Modified Log Barrier Method for Linear Programming
- Limiting behavior of the central path in semidefinite optimization
- The Łojasiewicz Inequality for Nonsmooth Subanalytic Functions with Applications to Subgradient Dynamical Systems
- Interior Gradient and Proximal Methods for Convex and Conic Optimization
- Dual convergence of the proximal point method with Bregman distances for linear programming
- Proof of the gradient conjecture of R. Thom.
