Pages that link to "Item:Q5189564"
From MaRDI portal
The following pages link to Convergence Analysis of Deflected Conditional Approximate Subgradient Methods (Q5189564):
Displayed 30 items.
- A stabilized structured Dantzig-Wolfe decomposition method (Q359629) (← links)
- An infeasible-point subgradient method using adaptive approximate projections (Q461434) (← links)
- Dynamic smoothness parameter for fast gradient methods (Q683921) (← links)
- A partially inexact bundle method for convex semi-infinite minmax problems (Q907208) (← links)
- Min-degree constrained minimum spanning tree problem with fixed centrals and terminals: complexity, properties and formulations (Q1652314) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- A proximal bundle method for constrained nonsmooth nonconvex optimization with inexact information (Q1704913) (← links)
- Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
- A storm of feasibility pumps for nonconvex MINLP (Q1925794) (← links)
- Bundle methods for sum-functions with ``easy'' components: applications to multicommodity network design (Q2248747) (← links)
- Primal convergence from dual subgradient methods for convex optimization (Q2340335) (← links)
- Large-scale unit commitment under uncertainty (Q2351161) (← links)
- A library for continuous convex separable quadratic knapsack problems (Q2355800) (← links)
- On proximal subgradient splitting method for minimizing the sum of two nonsmooth convex functions (Q2359139) (← links)
- Inexact stabilized Benders' decomposition approaches with application to chance-constrained problems with finite support (Q2374364) (← links)
- A Lagrangian propagator for artificial neural networks in constraint programming (Q2398510) (← links)
- Inexact subgradient methods for quasi-convex optimization problems (Q2629635) (← links)
- Scaling Techniques for $\epsilon$-Subgradient Methods (Q2817840) (← links)
- On the convergence of the forward–backward splitting method with linesearches (Q2829582) (← links)
- A Deflected Subgradient Method Using a General Augmented Lagrangian Duality with Implications on Penalty Methods (Q2995265) (← links)
- Incremental Bundle Methods using Upper Models (Q4603045) (← links)
- Weak subgradient method for solving nonsmooth nonconvex optimization problems (Q5009157) (← links)
- Using projected cutting planes in the extended cutting plane method (Q5057972) (← links)
- Abstract convergence theorem for quasi-convex optimization problems with applications (Q5228820) (← links)
- Solving Basis Pursuit (Q5270711) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- A proximal bundle method for nonsmooth nonconvex functions with inexact information (Q5963307) (← links)
- Essentials of numerical nonsmooth optimization (Q5970841) (← links)
- A redistributed proximal bundle method for nonsmooth nonconvex functions with inexact information (Q6059582) (← links)
- A study of auction mechanisms for multilateral procurement based on subgradient and bundle methods (Q6160378) (← links)