The following pages link to (Q4182272):
Displayed 29 items.
- On Lipschitz optimization based on gray-box piecewise linearization (Q304252) (← links)
- Strongly sub-feasible direction method for constrained optimization problems with nonsmooth objective functions (Q439450) (← links)
- A smooth method for the finite minimax problem (Q689121) (← links)
- Proximity control in bundle methods for convex nondifferentiable minimization (Q911994) (← links)
- An aggregate subgradient method for nonsmooth and nonconvex minimization (Q1082780) (← links)
- On Poljak's improved subgradient method (Q1090617) (← links)
- A subgradient selection method for minimizing convex functions subject to linear constraints (Q1092621) (← links)
- Minimization of convex functionals involving nested maxima: Nonconcave duality and algorithms (Q1148809) (← links)
- Exact penalty functions in proximal bundle methods for constrained convex nondifferentiable minimization (Q1181737) (← links)
- Modified cutting plane method for minimization of a convex function (Q1280984) (← links)
- Inexact subgradient methods with applications in stochastic programming (Q1315432) (← links)
- Multicriterion structure/control design for optimal maneuverability and fault tolerance of flexible spacecraft (Q1333346) (← links)
- Constraint aggregation principle in convex optimization (Q1356049) (← links)
- \(r\)-algorithms and ellipsoids (Q1364116) (← links)
- New variants of bundle methods (Q1922693) (← links)
- Complexity estimates of some cutting plane methods based on the analytic barrier (Q1922694) (← links)
- A descent method with linear programming subproblems for nondifferentiable convex optimization (Q1924056) (← links)
- Rate of convergence of the bundle method (Q2412838) (← links)
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
- An aggregate subgradient method for nonsmooth convex minimization (Q3039046) (← links)
- A descent algorithm for nonsmooth convex optimization (Q3337229) (← links)
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization (Q3730358) (← links)
- Variants to the cutting plane approach for convex nondifferentiable optimization (Q4327932) (← links)
- Residual Selection in A Projection Method for Convex Minimization Problems (Q4430670) (← links)
- Global and superlinear convergence of an algorithm for one-dimensional minimization of convex functions (Q4742570) (← links)
- A Proximal Bundle Variant with Optimal Iteration-Complexity for a Large Range of Prox Stepsizes (Q5013585) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- Essentials of numerical nonsmooth optimization (Q5970841) (← links)
- Minimizing oracle-structured composite functions (Q6173766) (← links)