An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming
From MaRDI portal
Publication:616787
DOI10.1007/s10589-008-9227-0zbMath1269.90077OpenAlexW2116040458MaRDI QIDQ616787
Publication date: 12 January 2011
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-008-9227-0
Related Items
On the Lorentz Cone Complementarity Problems in Infinite-Dimensional Real Hilbert Space, The decompositions with respect to two core non-symmetric cones
Cites Work
- Unnamed Item
- Unnamed Item
- On the convergence of the exponential multiplier method for convex programming
- Multiplicative iterative algorithms for convex programming
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- Applications of second-order cone programming
- The Minnesota notes on Jordan algebras and their applications. Edited and annotated by Aloys Krieg and Sebastian Walcher
- Proximal minimization algorithm with \(D\)-functions
- Linear systems in Jordan algebras and primal-dual interior-point algorithms
- Euclidean Jordan algebras and interior-point algorithms
- Extension of primal-dual interior point algorithms to symmetric cones
- Second-order cone programming
- A primal-dual potential reduction method for problems involving matrix inequalities
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Monotone Operators and the Proximal Point Algorithm
- Perturbation des méthodes d'optimisation. Applications
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- An Interior Proximal Algorithm and the Exponential Multiplier Method for Semidefinite Programming
- Convergence of Proximal-Like Algorithms
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Entropy-Like Proximal Methods in Convex Programming
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
- Proximité et dualité dans un espace hilbertien
- Convex Analysis
