scientific article; zbMATH DE number 3619637
From MaRDI portal
Publication:4182272
zbMATH Open0398.90090MaRDI QIDQ4182272FDOQ4182272
Authors: Claude Lemaréchal 
Publication date: 1978
Title of this publication is not available (Why is that?)
ConvergenceSubgradientsDescent MethodsBoxstep MethodBundle MethodLinear SearchNonsmooth Optimization
Nonlinear programming (90C30) Newton-type methods (49M15) Methods of reduced gradient type (90C52) Mathematical programming (90C99)
Cited In (31)
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions
- A subgradient selection method for minimizing convex functions subject to linear constraints
- Constraint aggregation principle in convex optimization
- \(r\)-algorithms and ellipsoids
- Proximity control in bundle methods for convex nondifferentiable minimization
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition
- Essentials of numerical nonsmooth optimization
- A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes
- Minimizing oracle-structured composite functions
- Complexity estimates of some cutting plane methods based on the analytic barrier
- On Lipschitz optimization based on gray-box piecewise linearization
- New variants of bundle methods
- Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions
- Minimization of convex functionals involving nested maxima: Nonconcave duality and algorithms
- Inexact subgradient methods with applications in stochastic programming
- Variants to the cutting plane approach for convex nondifferentiable optimization
- A single cut proximal bundle method for stochastic convex composite optimization
- On Poljak's improved subgradient method
- Implementation of an oracle-structured bundle method for distributed optimization
- An aggregate subgradient method for nonsmooth convex minimization
- Multicriterion structure/control design for optimal maneuverability and fault tolerance of flexible spacecraft
- A descent algorithm for nonsmooth convex optimization
- Modified cutting plane method for minimization of a convex function
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization
- A smooth method for the finite minimax problem
- A descent method with linear programming subproblems for nondifferentiable convex optimization
- An aggregate subgradient method for nonsmooth and nonconvex minimization
- Rate of convergence of the bundle method
- Residual Selection in A Projection Method for Convex Minimization Problems
- Essentials of numerical nonsmooth optimization
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4182272)
