Minimizing and stationary sequences of convex constrained minimization problems

DOI10.1023/A:1017575415432zbMath0987.90067OpenAlexW132639066MaRDI QIDQ5958080

No author found.

Publication date: 3 June 2002

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1017575415432

zbMATH Keywords

convexityminimizing sequencesconstrained convex minimizationmetrical regularityMoreau-Yosida regularizationstationary sequences

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items

An approximate quasi-Newton bundle-type method for nonsmooth optimization ⋮ Two parallel distribution algorithms for convex constrained minimization problems ⋮ A proximal analytic center cutting plane algorithm for solving variational inequality problems ⋮ A relationship between pseudomonotone and monotone mappings. ⋮ An approximate bundle-type auxiliary problem method for solving generalized variational inequalities

Cites Work

• Unnamed Item
• Convergence of some algorithms for convex minimization
• Error bounds in mathematical programming
• A descent algorithm for nonsmooth convex optimization
• Monotone Operators and the Proximal Point Algorithm
• Minimizing and Stationary Sequences of Constrained Optimization Problems
• Quasi-Newton Bundle-Type Methods for Nondifferentiable Convex Optimization
• Convergence analysis of a proximal newton method¹
• A Globally and Superlinearly Convergent Algorithm for Nonsmooth Convex Minimization
• Numerical methods for nondifferentiable convex optimization