Moreau-Yosida regularization of Lagrangian-dual functions for a class of convex optimization problems
From MaRDI portal
Publication:839325
DOI10.1007/s10898-008-9333-7zbMath1191.90036OpenAlexW2009294745MaRDI QIDQ839325
Publication date: 2 September 2009
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-008-9333-7
Convex programming (90C25) Numerical optimization and variational techniques (65K10) Convex functions and convex programs in convex geometry (52A41)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Properties of the Moreau-Yosida regularization of a piecewise \(C^2\) convex function
- A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming
- Quadratic convergence of Newton's method for convex interpolation and smoothing
- A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
- A nonsmooth version of Newton's method
- Semismoothness of solutions to generalized equations and the Moreau-Yosida regularization
- Introduction to Piecewise Differentiable Equations
- Directional derivative of the marginal function in nonlinear programming
- Lagrangian-Dual Functions and Moreau–Yosida Regularization
- Optimization and nonsmooth analysis
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- Semismooth and Semiconvex Functions in Constrained Optimization
- Smoothing Methods and Semismooth Methods for Nondifferentiable Operator Equations
- A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
- Piecewise Smoothness, Local Invertibility, and Parametric Analysis of Normal Maps
- Proximité et dualité dans un espace hilbertien
- Convex Analysis
- Semismooth Matrix-Valued Functions
- Semismooth Homeomorphisms and Strong Stability of Semidefinite and Lorentz Complementarity Problems
- Convergence of Newton's method for convex best interpolation
