Pages that link to "Item:Q3725884"
From MaRDI portal
The following pages link to A class of convergent primal-dual subgradient algorithms for decomposable convex programs (Q3725884):
Displaying 15 items.
- An algebraic theory for primal and dual substructuring methods by constraints (Q557935) (← links)
- Dual subgradient method with averaging for optimal resource allocation (Q723992) (← links)
- A decomposition-dualization approach for solving constrained convex minimization problems with applications to discretized obstacle problems (Q1113621) (← links)
- A primal-dual conjugate subgradient algorithm for specially structured linear and convex programming problems (Q1122488) (← links)
- Relaxations for probabilistically constrained programs with discrete random variables (Q1197883) (← links)
- Inexact subgradient methods with applications in stochastic programming (Q1315432) (← links)
- Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming (Q1742902) (← links)
- Approximations in proximal bundle methods and decomposition of convex programs (Q1893328) (← links)
- A primal-dual approach to inexact subgradient methods (Q1919096) (← links)
- Primal convergence from dual subgradient methods for convex optimization (Q2340335) (← links)
- Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs (Q2564623) (← links)
- (Q3476613) (← links)
- Primal-Dual Combinatorial Relaxation Algorithms for the Maximum Degree of Subdeterminants (Q4891748) (← links)
- Excessive Gap Technique in Nonsmooth Convex Minimization (Q5317557) (← links)
- On using exterior penalty approaches for solving linear programming problems (Q5945315) (← links)
