On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems
From MaRDI portal
Publication:5348470
DOI10.1137/16M1061849zbMath1369.90102MaRDI QIDQ5348470
Publication date: 18 August 2017
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
large-scale optimizationinterior-point methodspreconditioned conjugate gradientprincipal anglesstructured problems
Large-scale problems in mathematical programming (90C06) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Interior-point methods (90C51)
Related Items
An adaptive nonmonotone line search for multiobjective optimization problems, An almost exact solution to the min completion time variance in a single machine, A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clustering-based preconditioning for stochastic programs
- Mathematical programming approaches for classes of random network problems
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
- Quadratic regularizations in an interior-point method for primal block-angular problems
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
- ACCPM with a nonlinear constraint and an active set strategy to solve nonlinear multicommodity flow problems
- An implementation of linear and nonlinear multicommodity network flows
- Parallel interior-point solver for structured linear programs
- 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
- Preconditioning indefinite systems in interior point methods for optimization
- Improving an interior-point approach for large block-angular problems by hybrid preconditioners
- An interior-point approach for primal block-angular problems
- Interior-point solver for convex separable 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 Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM
- Progress Made in Solving the Multicommodity Flow Problem
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- A Specialized Interior-Point Algorithm for Multicommodity Network Flows
- New Preconditioners for KKT Systems of Network Flow Problems
- Numerical Methods for Computing Angles Between Linear Subspaces
- A Matrix-Free Preconditioner for Sparse Symmetric Positive Definite Systems and Least-Squares Problems
- A Multipreconditioned Conjugate Gradient Algorithm
