Interior-point solver for convex separable block-angular problems
DOI10.1080/10556788.2015.1050014zbMath1338.90455MaRDI QIDQ2811483
Publication date: 10 June 2016
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2015.1050014
large-scale optimization; interior-point methods; normal equations; preconditioned conjugate gradient; optimization software; structured problems
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C06: Large-scale problems in mathematical programming
90C20: Quadratic programming
90C05: Linear programming
90C51: Interior-point methods
65F10: Iterative numerical methods for linear systems
65Y05: Parallel numerical computation
65F08: Preconditioners for iterative methods
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A second-order method for strongly convex \(\ell _1\)-regularization problems
- Using the primal-dual interior point algorithm within the branch-price-and-cut method
- Recent advances in optimization techniques for statistical tabular data protection
- Matrix-free interior point method
- Quadratic regularizations in an interior-point method for primal block-angular problems
- Matrix-free interior point method for compressed sensing problems
- Splittings of symmetric matrices and a question of Ortega
- Parallel interior-point solver for structured linear programs
- Solving difficult multicommodity problems with a specialized interior-point algorithm
- Potential function methods for approximately solving linear programming problems: theory and practice.
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem
- Preconditioning indefinite systems in interior point methods for optimization
- A structure-conveying modelling language for mathematical and stochastic programming
- Improving an interior-point approach for large block-angular problems by hybrid preconditioners
- An interior-point approach for primal block-angular problems
- Convergence Analysis of an Inexact Feasible Interior Point Method for Convex Quadratic Programming
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
- Solving Real-World Linear Programs: A Decade and More of Progress
- LAPACK Users' Guide
- On the Implementation of a Primal-Dual Interior Point Method
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- Constraint Preconditioning for Indefinite Linear Systems
- A Specialized Interior-Point Algorithm for Multicommodity Network Flows
- New Preconditioners for KKT Systems of Network Flow Problems
- A Matrix-Free Preconditioner for Sparse Symmetric Positive Definite Systems and Least-Squares Problems
- The Lanczos and Conjugate Gradient Algorithms
- Interior Point Methods for Linear Optimization