Pages that link to "Item:Q1016352"
From MaRDI portal
The following pages link to Two ``well-known'' properties of subgradient optimization (Q1016352):
Displaying 24 items.
- Primal-dual subgradient methods for convex problems (Q116219) (← links)
- A decomposition method for large scale MILPs, with performance guarantees and a power system application (Q259426) (← links)
- Subgradient method for nonconvex nonsmooth optimization (Q353174) (← links)
- Sparse nonnegative matrix underapproximation and its application to hyperspectral image analysis (Q389667) (← links)
- An infeasible-point subgradient method using adaptive approximate projections (Q461434) (← links)
- Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems (Q526828) (← links)
- Divide to conquer: decomposition methods for energy optimization (Q715247) (← links)
- An inexact primal-dual algorithm for semi-infinite programming (Q784788) (← links)
- Using underapproximations for sparse nonnegative matrix factorization (Q962750) (← links)
- Conditional subgradient optimization -- theory and applications (Q1266608) (← links)
- A relax-and-cut framework for large-scale maximum weight connected subgraph problems (Q1652399) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- Large-scale unit commitment under uncertainty: an updated literature survey (Q1730531) (← links)
- An effective line search for the subgradient method (Q1781859) (← links)
- Accelerating the convergence of subgradient optimisation (Q1847153) (← links)
- Aggregate subgradient method for nonsmooth DC optimization (Q1996741) (← links)
- A fast exact method for the capacitated facility location problem with differentiable convex production costs (Q2030454) (← links)
- Asynchronous Lagrangian scenario decomposition (Q2246185) (← links)
- Primal convergence from dual subgradient methods for convex optimization (Q2340335) (← links)
- Large-scale unit commitment under uncertainty (Q2351161) (← links)
- A Lagrangian-ACO matheuristic for car sequencing (Q2513756) (← links)
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem (Q2815470) (← links)
- Planning Online Advertising Using Gini Indices (Q5129191) (← links)
- Column elimination for capacitated vehicle routing problems (Q6057244) (← links)