An inexact interior-point Lagrangian decomposition algorithm with inexact oracles
From MaRDI portal
Abstract: We develop a new inexact interior-point Lagrangian decomposition method to solve a wide range class of constrained composite convex optimization problems. Our method relies on four techniques: Lagrangian dual decomposition, self-concordant barrier smoothing, path-following, and proximal-Newton technique. It also allows one to approximately compute the solution of the primal subproblems (called the slave problems), which leads to inexact oracles (i.e., inexact gradients and Hessians) of the smoothed dual problem (called the master problem). The smoothed dual problem is nonsmooth, we propose to use an inexact proximal-Newton method to solve it. By appropriately controlling the inexact computation at both levels: the slave and master problems, we still estimate a polynomial-time iteration-complexity of our algorithm as in standard short-step interior-point methods. We also provide a strategy to recover primal solutions and establish complexity to achieve an approximate primal solution. We illustrate our method through two numerical examples on well-known models with both synthetic and real data and compare it with some existing state-of-the-art methods.
Recommendations
- An inexact perturbed path-following method for Lagrangian decomposition in large-scale separable convex optimization
- Fast inexact decomposition algorithms for large-scale separable convex optimization
- Composite convex optimization with global and local inexact oracles
- An inexact proximal augmented Lagrangian framework with arbitrary linearly convergent inner solver for composite convex optimization
- scientific article; zbMATH DE number 6027005
Cites work
- scientific article; zbMATH DE number 51132 (Why is no real title available?)
- scientific article; zbMATH DE number 729680 (Why is no real title available?)
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming
- A Newton-CG augmented Lagrangian method for semidefinite programming
- A first-order primal-dual algorithm for convex problems with applications to imaging
- A highly efficient semismooth Newton augmented Lagrangian method for solving lasso problems
- A single-phase, proximal path-following framework
- An inexact perturbed path-following method for Lagrangian decomposition in large-scale separable convex optimization
- An inexact proximal path-following algorithm for constrained convex minimization
- An interior-point method for a class of saddle-point problems
- An interior-point smoothing technique for Lagrangian relaxation in large-scale convex programming†
- Barrier subgradient method
- Decomposition and Partitioning Methods for Multistage Stochastic Linear Programs
- Decomposition techniques in mathematical programming. Engineering and science applications.
- Distributed Spectrum Management Algorithms for Multiuser DSL Networks
- Distributed primal–dual interior-point methods for solving tree-structured coupled convex problems using message-passing
- Gradient methods for minimizing composite functions
- Interior-point Lagrangian decomposition method for separable convex optimization
- Introductory lectures on convex optimization. A basic course.
- Lagrangian Dual Interior-Point Methods for Semidefinite Programs
- On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
- Self-concordant inclusions: a unified framework for path-following generalized Newton-type algorithms
Cited in
(3)
This page was built for publication: An inexact interior-point Lagrangian decomposition algorithm with inexact oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2188950)
