scientific article; zbMATH DE number 3619637

zbMath0398.90090MaRDI QIDQ4182272

Claude Lemaréchal

Publication date: 1978

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

ConvergenceSubgradientsDescent MethodsBoxstep MethodBundle MethodLinear SearchNonsmooth Optimization

Mathematics Subject Classification ID

Nonlinear programming (90C30) Newton-type methods (49M15) Methods of reduced gradient type (90C52) Mathematical programming (90C99)

Related Items (29)

An aggregate subgradient method for nonsmooth and nonconvex minimization ⋮ Multicriterion structure/control design for optimal maneuverability and fault tolerance of flexible spacecraft ⋮ On Poljak's improved subgradient method ⋮ A subgradient selection method for minimizing convex functions subject to linear constraints ⋮ On Lipschitz optimization based on gray-box piecewise linearization ⋮ Constraint aggregation principle in convex optimization ⋮ A method of linearizations for linearly constrained nonconvex nonsmooth minimization ⋮ \(r\)-algorithms and ellipsoids ⋮ New variants of bundle methods ⋮ Complexity estimates of some cutting plane methods based on the analytic barrier ⋮ A descent method with linear programming subproblems for nondifferentiable convex optimization ⋮ Rate of convergence of the bundle method ⋮ Variants to the cutting plane approach for convex nondifferentiable optimization ⋮ Minimization of convex functionals involving nested maxima: Nonconcave duality and algorithms ⋮ Minimizing oracle-structured composite functions ⋮ Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions ⋮ Proximity control in bundle methods for convex nondifferentiable minimization ⋮ Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization ⋮ A smooth method for the finite minimax problem ⋮ A descent algorithm for nonsmooth convex optimization ⋮ An aggregate subgradient method for nonsmooth convex minimization ⋮ Residual Selection in A Projection Method for Convex Minimization Problems ⋮ Essentials of numerical nonsmooth optimization ⋮ Modified cutting plane method for minimization of a convex function ⋮ Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions ⋮ A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes ⋮ Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition ⋮ Essentials of numerical nonsmooth optimization ⋮ Inexact subgradient methods with applications in stochastic programming

This page was built for publication: