Pages that link to "Item:Q354625"
From MaRDI portal
The following pages link to Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems (Q354625):
Displaying 14 items.
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints (Q255080) (← links)
- A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints (Q301677) (← links)
- Nesterov's smoothing and excessive gap methods for an optimization problem in VLSI placement (Q489145) (← links)
- Adaptive inexact fast augmented Lagrangian methods for constrained convex optimization (Q519779) (← links)
- Adaptive smoothing algorithms for nonsmooth composite convex minimization (Q523569) (← links)
- AAR-based decomposition algorithm for non-linear convex optimisation (Q902092) (← links)
- Solving nearly-separable quadratic optimization problems as nonsmooth equations (Q2013144) (← links)
- A unified convergence rate analysis of the accelerated smoothed gap reduction algorithm (Q2128772) (← links)
- Path-following gradient-based decomposition algorithms for separable convex optimization (Q2249817) (← links)
- An alternating trust region algorithm for distributed linearly constrained nonlinear programs, application to the optimal power flow problem (Q2412836) (← links)
- Fast inexact decomposition algorithms for large-scale separable convex optimization (Q2790883) (← links)
- Non-stationary First-Order Primal-Dual Algorithms with Faster Convergence Rates (Q4971027) (← links)
- A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA (Q5963317) (← links)
- Linearized generalized ADMM-based algorithm for multi-block linearly constrained separable convex programming in real-world applications (Q6126060) (← links)
