A bundle type approach to the unconstrained minimization of convex nonsmooth functions
From MaRDI portal
Publication:3938844
DOI10.1007/BF01583790zbMath0479.90066OpenAlexW2084491165MaRDI QIDQ3938844
Maria Flavia Monaco, Manlio Gaudioso
Publication date: 1982
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01583790
global convergencenonsmooth optimizationsubdifferentialunconstrained minimizationconjugate subgradient methodresettingconvex nonsmooth functionbundle type approachdeletion rule
Related Items
A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities, Tuning strategy for the proximity parameter in convex minimization, Survey of Bundle Methods for Nonsmooth Optimization, A bundle modification strategy for convex minimization, Smooth transformation of the generalized minimax problem, A descent method with linear programming subproblems for nondifferentiable convex optimization, A method for convex minimization based on translated first-order approximations, An effective nonsmooth optimization algorithm for locally Lipschitz functions, An active set strategy to address the ill-conditioning of smoothing methods for solving finite linear minimax problems, Variants to the cutting plane approach for convex nondifferentiable optimization, Nonmonotone algorithm for minimax optimization problems, An \(\varepsilon\)-generalized gradient projection method for nonlinear minimax problems, A QP-free algorithm for finite minimax problems, Discrete gradient method: Derivative-free method for nonsmooth optimization, A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints, A spline smoothing Newton method for finite minimax problems, A smooth method for the finite minimax problem, An adaptive competitive penalty method for nonsmooth constrained optimization, An approximate subgradient algorithm for unconstrained nonsmooth, nonconvex optimization, A descent algorithm for nonsmooth convex optimization, A truncated aggregate smoothing Newton method for minimax problems, A hybrid algorithm for nonlinear minimax problems, Trust-Region Methods for the Derivative-Free Optimization of Nonsmooth Black-Box Functions, Essentials of numerical nonsmooth optimization, New exact penalty function for solving constrained finite min-max problems, An active set smoothing method for solving unconstrained minimax problems, A new nonsmooth trust region algorithm for locally Lipschitz unconstrained optimization problems, Nonsmooth optimization methods for parallel decomposition of multicommodity flow problems, Essentials of numerical nonsmooth optimization, Aggregate codifferential method for nonsmooth DC optimization, Nonmonotone bundle-type scheme for convex nonsmooth minimization
Cites Work
