An Asymptotically Superlinearly Convergent Semismooth Newton Augmented Lagrangian Method for Linear Programming
From MaRDI portal
Publication:5124003
DOI10.1137/19M1251795zbMath1450.90007arXiv1903.09546MaRDI QIDQ5124003
Kim-Chuan Toh, Defeng Sun, Xudong Li
Publication date: 17 September 2020
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.09546
Convex programming (90C25) Large-scale problems in mathematical programming (90C06) Linear programming (90C05) Iterative numerical methods for linear systems (65F10)
Related Items
An augmented Lagrangian method with constraint generation for shape-constrained convex regression problems, General-purpose preconditioning for regularized interior point methods, A fast solver for generalized optimal transport problems based on dynamical system and algebraic multigrid, Faster first-order primal-dual methods for linear programming using restarts and sharpness, Fast sinkhorn. II: Collinear triangular matrix and linear time accurate computation of optimal transport, A primal-dual flow for affine constrained convex optimization, Efficient Sparse Hessian-Based Semismooth Newton Algorithms for Dantzig Selector
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints
- A Newton method for linear programming
- Generalized Hessian matrix and second-order optimality conditions for problems with \(C^{1,1}\) data
- Implementing proximal point methods for linear programming
- On the Douglas-Rachford splitting method and the proximal point algorithm for maximal monotone operators
- Proximal quasi-Newton methods for nondifferentiable convex optimization
- Nonsmooth equations in optimization. Regularity, calculus, methods and applications
- On the minimum norm solution of linear programs
- On the superlinear convergence of the variable metric proximal point algorithm using Broyden and BFGS matrix secant updating
- QSDPNAL: a two-phase augmented Lagrangian method for convex quadratic semidefinite programming
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- A family of variable metric proximal methods
- On finite termination of an iterative method for linear complementarity problems
- Preconditioning indefinite systems in interior point methods for optimization
- Testing and non-linear preconditioning of the proximal point method
- On the equivalence of inexact proximal ALM and ADMM for a class of convex composite programming
- Implementation of an interior point method with basis preconditioning
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
- Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning
- Clustering with qualitative information
- Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming
- A Newton-CG Augmented Lagrangian Method for Semidefinite Programming
- Asymptotic Convergence Analysis of the Proximal Point Algorithm
- Preconditioning indefinite systems in interior point methods for large scale linear optimisation
- A Class of Inexact Variable Metric Proximal Point Algorithms
- Optimization and nonsmooth analysis
- Nonlinear Perturbation of Linear Programs
- Some continuity properties of polyhedral multifunctions
- Monotone Operators and the Proximal Point Algorithm
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- A Variable Metric Proximal Point Algorithm for Monotone Operators
- Variational Analysis
- Nonlinear Proximal Point Algorithms Using Bregman Functions, with Applications to Convex Programming
- Convex Analysis
- Augmented Lagrangian method for large-scale linear programming problems
- Convex analysis and monotone operator theory in Hilbert spaces
