scientific article; zbMATH DE number 3619637

Cited in

(31)

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

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)