Proximal-like algorithm using the quasi D-function for convex second-order cone programming
From MaRDI portal
Publication:937140
DOI10.1007/s10957-008-9380-8zbMath1211.90237MaRDI QIDQ937140
Publication date: 20 August 2008
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-9380-8
90C30: Nonlinear programming
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Analysis of nonsmooth vector-valued functions associated with second-order cones.
- Multiplicative iterative algorithms for convex programming
- A relaxed version of Bregman's method for convex programming
- Applications of second-order cone programming
- An iterative row-action method for interval convex programming
- Proximal minimization algorithm with \(D\)-functions
- Second-order cone programming
- Interior point methods for second-order cone programming and OR applications
- Some properties of generalized proximal point methods for quadratic and linear programming
- Double-regularization proximal methods, with complementarity applications
- An unconstrained smooth minimization reformulation of the second-order cone complementarity problem
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- Convergence Analysis of a Proximal-Like Minimization Algorithm Using Bregman Functions
- 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
- Proximal Minimization Methods with Generalized Bregman Functions
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Proximité et dualité dans un espace hilbertien
- Convex Analysis
