On geometrical properties of preconditioners in IPMs for classes of block-angular problems
From MaRDI portal
Recommendations
- 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
- A study of preconditioners for network interior point methods
- Block preconditioners for linear systems in interior point methods for convex constrained optimization
Cites work
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
- A matrix-free preconditioner for sparse symmetric positive definite systems and least-squares problems
- A Multipreconditioned Conjugate Gradient Algorithm
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- A proximal cutting plane method using Chebychev center for nonsmooth convex optimization
- A Specialized Interior-Point Algorithm for Multicommodity Network Flows
- 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
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
- An interior-point approach for primal block-angular problems
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
- Clustering-based preconditioning for stochastic programs
- Convergence analysis of an inexact feasible interior point method for convex quadratic programming
- scientific article; zbMATH DE number 43693 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- Improving an interior-point approach for large block-angular problems by hybrid preconditioners
- Interior-point solver for convex separable block-angular problems
- Mathematical programming approaches for classes of random network problems
- New Preconditioners for KKT Systems of Network Flow Problems
- Numerical Methods for Computing Angles Between Linear Subspaces
- Parallel interior-point solver for structured linear programs
- Potential function methods for approximately solving linear programming problems: theory and practice.
- Preconditioning indefinite systems in interior point methods for optimization
- Progress Made in Solving the Multicommodity Flow Problem
- Quadratic regularizations in an interior-point method for primal block-angular problems
- Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM
Cited in
(7)- A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
- An almost exact solution to the min completion time variance in a single machine
- Improving an interior-point approach for large block-angular problems by hybrid preconditioners
- An interior-point approach for primal block-angular problems
- An adaptive nonmonotone line search for multiobjective optimization problems
- Interior-point solver for convex separable block-angular problems
- The Effect of a Minimum Angle Condition on the Preconditioning of the Pivot Block Arising from 2-Level-Splittings of Crouzeix-Raviart FE-Spaces
This page was built for publication: On geometrical properties of preconditioners in IPMs for classes of block-angular problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5348470)
