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-0zbMATH Open1269.90077OpenAlexW2116040458MaRDI QIDQ616787FDOQ616787
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
Recommendations
- Entropy-Like Proximal Methods in Convex Programming
- A unifying approach to entropy-like multiplier methods in convex programming
- Entropic proximal decomposition methods for convex programs and variational inequalities
- On the convergence of the entropy-exponential penalty trajectories and generalized proximal point methods in semidefinite optimization
- An efficient implementable inexact entropic proximal point algorithm for a class of linear programming problems
- A maximum entropy method for convex programming
- scientific article; zbMATH DE number 2248400
- An inexact accelerated proximal gradient method and a dual Newton-CG method for the maximal entropy problem
- Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming
- On the convergence of the exponential multiplier method for convex programming
Cites Work
- Title not available (Why is that?)
- Convex Analysis
- Title not available (Why is that?)
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Proximité et dualité dans un espace hilbertien
- On the convergence of the exponential multiplier method for convex programming
- Applications of second-order cone programming
- Second-order cone programming
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- On the Convergence of the Proximal Point Algorithm for Convex Minimization
- Convergence of Proximal-Like Algorithms
- Convexity and differentiability properties of spectral functions and spectral mappings on Euclidean Jordan algebras
- 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
- Entropy-Like Proximal Methods in Convex Programming
- Convergence Rate Analysis of Nonquadratic Proximal Methods for Convex and Linear Programming
- Multiplicative iterative algorithms for convex programming
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- Entropic Proximal Mappings with Applications to Nonlinear Programming
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- The Minnesota notes on Jordan algebras and their applications. Edited and annotated by Aloys Krieg and Sebastian Walcher
- Perturbation des méthodes d'optimisation. Applications
- A primal-dual potential reduction method for problems involving matrix inequalities
- An Interior Proximal Algorithm and the Exponential Multiplier Method for Semidefinite Programming
Cited In (6)
- On the convergence of the exponential multiplier method for convex programming
- Entropy-Like Minimization Methods Based On Modified Proximal Point Algorithm
- On the Lorentz Cone Complementarity Problems in Infinite-Dimensional Real Hilbert Space
- A unifying approach to entropy-like multiplier methods in convex programming
- The decompositions with respect to two core non-symmetric cones
- Title not available (Why is that?)
This page was built for publication: An entropy-like proximal algorithm and the exponential multiplier method for convex symmetric cone programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616787)
