An inexact perturbed path-following method for Lagrangian decomposition in large-scale separable convex optimization
From MaRDI portal
(Redirected from Publication:5300519)
Abstract: In this paper, we propose an inexact perturbed path-following algorithm in the framework of Lagrangian dual decomposition for solving large-scale structured convex optimization problems. Unlike the exact versions considered in literature, we allow one to solve the primal problem inexactly up to a given accuracy. The inexact perturbed algorithm allows to use both approximate Hessian matrices and approximate gradient vectors to compute Newton-type directions for the dual problem. The algorithm is divided into two phases. The first phase computes an initial point which makes use of inexact perturbed damped Newton-type iterations, while the second one performs the path-following algorithm with inexact perturbed full-step Newton-type iterations. We analyze the convergence of both phases and estimate the worst-case complexity. As a special case, an exact path- following algorithm for Lagrangian relaxation is derived and its worst-case complexity is estimated. This variant possesses some differences compared to the previously known methods. Implementation details are discussed and numerical results are reported.
Recommendations
- Fast inexact decomposition algorithms for large-scale separable convex optimization
- Interior-point Lagrangian decomposition method for separable convex optimization
- An inexact interior-point Lagrangian decomposition algorithm with inexact oracles
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
- Path-following gradient-based decomposition algorithms for separable convex optimization
Cited in
(20)- An inexact dual fast gradient-projection method for separable convex optimization with linear coupled constraints
- Composite convex optimization with global and local inexact oracles
- Linearized generalized ADMM-based algorithm for multi-block linearly constrained separable convex programming in real-world applications
- Combining Lagrangian decomposition and excessive gap smoothing technique for solving large-scale separable convex optimization problems
- Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms
- Generalized self-concordant functions: a recipe for Newton-type methods
- A partially parallel splitting method for multiple-block separable convex programming with applications to robust PCA
- Solving nearly-separable quadratic optimization problems as nonsmooth equations
- Fast inexact decomposition algorithms for large-scale separable convex optimization
- Numerical structure of the Hessian of the Lagrange dual function for a class of convex problems
- Trajectory-following methods for large-scale degenerate convex quadratic programming
- On the convergence rate of the augmented Lagrangian-based parallel splitting method
- Path-following gradient-based decomposition algorithms for separable convex optimization
- A note on augmented Lagrangian-based parallel splitting method
- An inexact interior-point Lagrangian decomposition algorithm with inexact oracles
- An augmented Lagrangian based algorithm for distributed nonconvex optimization
- An interior-point smoothing technique for Lagrangian relaxation in large-scale convex programming†
- An exterior point polynomial-time algorithm for convex quadratic programming
- A proximal partially parallel splitting method for separable convex programs
- A distributed Douglas-Rachford splitting method for multi-block convex minimization problems
This page was built for publication: An inexact perturbed path-following method for Lagrangian decomposition in large-scale separable convex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300519)
