Convergence analysis of deflected conditional approximate subgradient methods
From MaRDI portal
Recommendations
- Conditional subgradient methods for constrained quasi-convex optimization problems
- Convergence of Approximate and Incremental Subgradient Methods for Convex Optimization
- On Convergence Properties of a Subgradient Method
- Incremental subgradient methods for nondifferentiable optimization
- Two ``well-known properties of subgradient optimization
Cited in
(31)- Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information
- Large-scale unit commitment under uncertainty: an updated literature survey
- A storm of feasibility pumps for nonconvex MINLP
- Bundle methods for sum-functions with ``easy components: applications to multicommodity network design
- Primal convergence from dual subgradient methods for convex optimization
- Large-scale unit commitment under uncertainty
- A library for continuous convex separable quadratic knapsack problems
- On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support
- A Lagrangian propagator for artificial neural networks in constraint programming
- Inexact subgradient methods for quasi-convex optimization problems
- Scaling techniques for -subgradient methods
- On the convergence of the forward-backward splitting method with linesearches
- A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods
- A stabilized structured Dantzig-Wolfe decomposition method
- Incremental bundle methods using upper models
- An infeasible-point subgradient method using adaptive approximate projections
- Weak subgradient method for solving nonsmooth nonconvex optimization problems
- Using projected cutting planes in the extended cutting plane method
- Abstract convergence theorem for quasi-convex optimization problems with applications
- Solving basis pursuit: heuristic optimality check and solver comparison
- Essentials of numerical nonsmooth optimization
- A proximal bundle method for nonsmooth nonconvex functions with inexact information
- Essentials of numerical nonsmooth optimization
- A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information
- A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods
- Statistical performance of subgradient step-size update rules in Lagrangian relaxations of chance-constrained optimization models
- Dynamic smoothness parameter for fast gradient methods
- A partially inexact bundle method for convex semi-infinite minmax problems
This page was built for publication: Convergence analysis of deflected conditional approximate subgradient methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5189564)
