A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems
From MaRDI portal
Publication:2307749
DOI10.1007/s10898-019-00842-6zbMath1476.90313OpenAlexW2981006683MaRDI QIDQ2307749
Yuqing Xu, Yang Zhou, Qian Liu
Publication date: 25 March 2020
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-019-00842-6
verificationglobal convergencesmoothing methodconstraint qualificationsexact penaltypenalty function algorithms
Related Items (2)
Convergence properties of a class of exact penalty methods for semi-infinite optimization problems ⋮ Smoothing Approximation to the New Exact Penalty Function with Two Parameters
Cites Work
- Unnamed Item
- Smooth minimization of non-smooth functions
- A doubly stabilized bundle method for nonsmooth convex optimization
- A smoothing trust region filter algorithm for nonsmooth least squares problems
- A dual method for minimizing a nonsmooth objective over one smooth inequality constraint
- Smoothing augmented Lagrangian method for nonsmooth constrained optimization problems
- The CoMirror algorithm for solving nonsmooth constrained convex problems
- On the convergence of the exponential multiplier method for convex programming
- Smoothing methods for nonsmooth, nonconvex minimization
- Proximity control in bundle methods for convex nondifferentiable minimization
- A preconditioning proximal Newton method for nondifferentiable convex optimization
- Global saddle points of nonlinear augmented Lagrangian functions
- A new class of exact penalty functions and penalty algorithms
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization
- Das Problem der dreizehn Kugeln
- Smoothing and First Order Methods: A Unified Framework
- Calmness and Exact Penalization
- An exact penalty function method with global convergence properties for nonlinear programming problems
- A New Exact Penalty Function
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- Exact penalty functions in nonlinear programming
This page was built for publication: A class of exact penalty functions and penalty algorithms for nonsmooth constrained optimization problems