Pages that link to "Item:Q5300519"
From MaRDI portal
The following pages link to An Inexact Perturbed Path-Following Method for Lagrangian Decomposition in Large-Scale Separable Convex Optimization (Q5300519):
Displaying 19 items.
- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints (Q255080) (← links)
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems (Q354625) (← links)
- A note on augmented Lagrangian-based parallel splitting method (Q497450) (← links)
- Composite convex optimization with global and local inexact oracles (Q1986105) (← links)
- Solving nearly-separable quadratic optimization problems as nonsmooth equations (Q2013144) (← links)
- An inexact interior-point Lagrangian decomposition algorithm with inexact oracles (Q2188950) (← links)
- Path-following gradient-based decomposition algorithms for separable convex optimization (Q2249817) (← links)
- Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms (Q2316618) (← links)
- Generalized self-concordant functions: a recipe for Newton-type methods (Q2330645) (← links)
- An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489) (← links)
- Trajectory-following methods for large-scale degenerate convex quadratic programming (Q2392932) (← links)
- Fast inexact decomposition algorithms for large-scale separable convex optimization (Q2790883) (← links)
- An augmented Lagrangian based algorithm for distributed nonconvex optimization (Q2805706) (← links)
- Numerical Structure of the Hessian of the Lagrange Dual Function for a Class of Convex Problems (Q2968548) (← links)
- On the convergence rate of the augmented Lagrangian-based parallel splitting method (Q4622886) (← links)
- A proximal partially parallel splitting method for separable convex programs (Q5268890) (← links)
- A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA (Q5963317) (← links)
- A distributed Douglas-Rachford splitting method for multi-block convex minimization problems (Q5965003) (← links)
- Linearized generalized ADMM-based algorithm for multi-block linearly constrained separable convex programming in real-world applications (Q6126060) (← links)
