Interior-point Lagrangian decomposition method for separable convex optimization
From MaRDI portal
Publication:846931
DOI10.1007/s10957-009-9566-8zbMath1184.90126arXiv1302.3136OpenAlexW2053764342MaRDI QIDQ846931
Johan A. K. Suykens, Ion Necoara
Publication date: 15 February 2010
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1302.3136
Related Items
A fast dual proximal-gradient method for separable convex optimization with linear coupled constraints ⋮ Parallel Random Coordinate Descent Method for Composite Minimization: Convergence Analysis and Error Bounds ⋮ Smoothing Techniques-Based Distributed Model Predictive Control Algorithms for Networks ⋮ Tracking-ADMM for distributed constraint-coupled optimization ⋮ An inexact interior-point Lagrangian decomposition algorithm with inexact oracles ⋮ Computational complexity certification for dual gradient method: application to embedded MPC ⋮ Numerical Structure of the Hessian of the Lagrange Dual Function for a Class of Convex Problems ⋮ Proximal alternating penalty algorithms for nonsmooth constrained convex optimization ⋮ Composite convex optimization with global and local inexact oracles ⋮ Path-following gradient-based decomposition algorithms for separable convex optimization ⋮ Solving nearly-separable quadratic optimization problems as nonsmooth equations ⋮ Fast inexact decomposition algorithms for large-scale separable convex optimization ⋮ Lagrangian penalization scheme with parallel forward-backward splitting ⋮ An Augmented Lagrangian Based Algorithm for Distributed NonConvex Optimization ⋮ Iteration complexity analysis of dual first-order methods for conic convex programming ⋮ An exterior point polynomial-time algorithm for convex quadratic programming ⋮ Distributed primal–dual interior-point methods for solving tree-structured coupled convex problems using message-passing ⋮ An interior point parameterized central path following algorithm for linearly constrained convex programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On some efficient interior point methods for nonlinear convex programming
- Global linear convergence of a path-following algorithm for some monotone variational inequality problems
- A proximal-based deomposition method for compositions method for convex minimization problems
- Parallel interior-point solver for structured linear programs
- Parallel interior point schemes for solving multistage convex programming
- A Lagrangian dual method with self-concordant barriers for multi-stage stochastic convex programming
- Constrained model predictive control: Stability and optimality
- On the method of multipliers for mathematical programming problems
- Alternating direction splittings for block angular parallel optimization
- A Mathematical View of Interior-Point Methods in Convex Optimization
- A path following algorithm for a class of convex programming problems
- Application of a Smoothing Technique to Decomposition in Convex Optimization
