Publication:4182272
From MaRDI portal
zbMath0398.90090MaRDI QIDQ4182272
Publication date: 1978
Convergence; Subgradients; Descent Methods; Boxstep Method; Bundle Method; Linear Search; Nonsmooth Optimization
90C30: Nonlinear programming
49M15: Newton-type methods
90C52: Methods of reduced gradient type
90C99: Mathematical programming
Related Items
Variants to the cutting plane approach for convex nondifferentiable optimization, Residual Selection in A Projection Method for Convex Minimization Problems, 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, Essentials of numerical nonsmooth optimization, Essentials of numerical nonsmooth optimization, Minimizing oracle-structured composite functions, On Lipschitz optimization based on gray-box piecewise linearization, Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions, A smooth method for the finite minimax problem, Proximity control in bundle methods for convex nondifferentiable minimization, An aggregate subgradient method for nonsmooth and nonconvex minimization, On Poljak's improved subgradient method, A subgradient selection method for minimizing convex functions subject to linear constraints, Minimization of convex functionals involving nested maxima: Nonconcave duality and algorithms, Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization, Modified cutting plane method for minimization of a convex function, Inexact subgradient methods with applications in stochastic programming, Multicriterion structure/control design for optimal maneuverability and fault tolerance of flexible spacecraft, Constraint aggregation principle in convex optimization, \(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, Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition, An aggregate subgradient method for nonsmooth convex minimization, A descent algorithm for nonsmooth convex optimization, A method of linearizations for linearly constrained nonconvex nonsmooth minimization
