Pages that link to "Item:Q3039046"
From MaRDI portal
The following pages link to An aggregate subgradient method for nonsmooth convex minimization (Q3039046):
Displayed 28 items.
- Comparison of bundle and classical column generation (Q2476993) (← links)
- Bundle-level type methods uniformly optimal for smooth and nonsmooth convex optimization (Q2515032) (← links)
- Convergence of the steepest descent method for minimizing quasiconvex functions (Q2564182) (← links)
- A \(\mathcal{VU}\)-algorithm for convex minimization (Q2576737) (← links)
- The bundle scheme for solving arbitrary eigenvalue optimizations (Q2628175) (← links)
- A Subgradient Method Based on Gradient Sampling for Solving Convex Optimization Problems (Q2795104) (← links)
- Diagonal discrete gradient bundle method for derivative free nonsmooth optimization (Q2817235) (← links)
- Limited memory discrete gradient bundle method for nonsmooth derivative-free optimization (Q3145057) (← links)
- Monotone methods with averaging of subgradients and their stochastic finite-difference analogs (Q3489792) (← links)
- A class of convergent primal-dual subgradient algorithms for decomposable convex programs (Q3725884) (← links)
- A method of linearizations for linearly constrained nonconvex nonsmooth minimization (Q3730358) (← links)
- A regularized decomposition method for minimizing a sum of polyhedral functions (Q3735489) (← links)
- The method of successive affine reduction for nonlinear minimization (Q3758575) (← links)
- A hierarchical approach to optimized control of water distribution systems: Part I decomposition (Q3804512) (← links)
- Multiple subgradient descent bundle method for convex nonsmooth multiobjective optimization (Q4639123) (← links)
- A DC piecewise affine model and a bundling technique in nonconvex nonsmooth minimization (Q4673325) (← links)
- Convergence analysis of a proximal newton method<sup>1</sup> (Q4714551) (← links)
- A quasi-Newton proximal bundle method using gradient sampling technique for minimizing nonsmooth convex functions (Q5058380) (← links)
- Adaptive Bundle Methods for Nonlinear Robust Optimization (Q5106409) (← links)
- A representation of generalized convex polyhedra and applications (Q5217253) (← links)
- Duality Results and Dual Bundle Methods Based on the Dual Method of Centers for Minimax Fractional Programs (Q5231677) (← links)
- A splitting bundle approach for non-smooth non-convex minimization (Q5248228) (← links)
- Bundle Method for Non-Convex Minimization with Inexact Subgradients and Function Values (Q5746456) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- Essentials of numerical nonsmooth optimization (Q5970841) (← links)
- A version of bundle trust region method with linear programming (Q6086138) (← links)
- A bundle-type method for nonsmooth DC programs (Q6154409) (← links)
- Optimal Convergence Rates for the Proximal Bundle Method (Q6155876) (← links)