Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
From MaRDI portal
Publication:1181737
DOI10.1007/BF01582892zbMath0754.90045OpenAlexW2093369076MaRDI QIDQ1181737
Publication date: 27 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582892
Global convergenceexact penalty approachesnondifferentiable convex constrained optimizationProximal bundle type methods
Numerical mathematical programming methods (65K05) Convex programming (90C25) Nonsmooth analysis (49J52) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Approximations in proximal bundle methods and decomposition of convex programs, Survey of Bundle Methods for Nonsmooth Optimization, Dynamic bundle methods, A variable metric method for nonsmooth convex constrained optimization, Special backtracking proximal bundle method for nonconvex maximum eigenvalue optimization, An approximate redistributed proximal bundle method with inexact data for minimizing nonsmooth nonconvex functions, Solving generation expansion planning problems with environmental constraints by a bundle method, A varying-parameter fixed-time gradient-based dynamic network for convex optimization, Coupling the gradient method with a general exterior penalization scheme for convex minimization, Limited memory interior point bundle method for large inequality constrained nonsmooth minimization, A New Sequential Optimality Condition for Constrained Nonsmooth Optimization, A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information, Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions, An infeasible bundle method for nonconvex constrained optimization with application to semi-infinite programming problems, Constrained nonconvex nonsmooth optimization via proximal bundle method, A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods, Nonsmooth Optimization, A feasible point method with bundle modification for nonsmooth convex constrained optimization, A quasisecant method for solving a system of nonsmooth equations, Computing proximal points of nonconvex functions, A bundle-filter method for nonsmooth convex constrained optimization, A fast space-decomposition scheme for nonconvex eigenvalue optimization, An adaptive competitive penalty method for nonsmooth constrained optimization, Outer-approximation algorithms for nonsmooth convex MINLP problems, A filter-variable-metric method for nonsmooth convex constrained optimization, An inexact bundle variant suited to column generation, An implementation of a reduced subgradient method via Luenberger-Mokhtar variant, Interior proximal bundle algorithm with variable metric for nonsmooth convex symmetric cone programming, Nonsmooth Optimization Method for H∞ Output Feedback Control, A new restricted memory level bundle method for constrained convex nonsmooth optimization, A proximal bundle method-based algorithm with penalty strategy and inexact oracles for constrained nonsmooth nonconvex optimization, A Proximal Bundle Method with Exact Penalty Technique and Bundle Modification Strategy for Nonconvex Nonsmooth Constrained Optimization, Implementation of a proximal algorithm for linearly constrained nonsmooth optimization problems and computational results
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proximity control in bundle methods for convex nondifferentiable minimization
- Penalty-proximal methods in convex programming
- A constraint linearization method for nondifferentiable convex minimization
- Test examples for nonlinear programming codes
- Methods of descent for nondifferentiable optimization
- Optimization and nonsmooth analysis
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization
- Solution of Systems of Complex Linear Equations in the $l_\infty $ Norm with Constraints on the Unknowns
- A Dual Method for Certain Positive Semidefinite Quadratic Programming Problems
- A modification and an extension of Lemarechal’s algorithm for nonsmooth minimization
- A Subgradient Algorithm for Certain Minimax and Minisum Problems—The Constrained Case
- On the Extension of Constrained Optimization Algorithms from Differentiable to Nondifferentiable Problems
- Sufficiency of Exact Penalty Minimization
- An Exact Penalty Function Algorithm for Non-smooth Convex Constrained Minimization Problems
