Interior-point solver for convex separable block-angular problems
From MaRDI portal
Publication:2811483
normal equationsinterior-point methodslarge-scale optimizationpreconditioned conjugate gradientoptimization softwarestructured problems
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Convex programming (90C25) Parallel numerical computation (65Y05) Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Interior-point methods (90C51) Preconditioners for iterative methods (65F08) Iterative numerical methods for linear systems (65F10)
Recommendations
- Improving an interior-point approach for large block-angular problems by hybrid preconditioners
- An interior-point approach for primal block-angular problems
- On geometrical properties of preconditioners in IPMs for classes of block-angular problems
- An Interior Point Method for Block Angular Optimization
- Quadratic regularizations in an interior-point method for primal block-angular problems
Cites work
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- scientific article; zbMATH DE number 964349 (Why is no real title available?)
- A Specialized Interior-Point Algorithm for Multicommodity Network Flows
- A matrix-free preconditioner for sparse symmetric positive definite systems and least-squares problems
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- A second-order method for strongly convex \(\ell _1\)-regularization problems
- A structure-conveying modelling language for mathematical and stochastic programming
- 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
- Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
- Constraint Preconditioning for Indefinite Linear Systems
- Convergence analysis of an inexact feasible interior point method for convex quadratic programming
- Improving an interior-point approach for large block-angular problems by hybrid preconditioners
- Interior Point Methods for Linear Optimization
- LAPACK Users' Guide
- Matrix-free interior point method
- Matrix-free interior point method for compressed sensing problems
- New Preconditioners for KKT Systems of Network Flow Problems
- On the Implementation of a Primal-Dual Interior Point Method
- 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
- Quadratic regularizations in an interior-point method for primal block-angular problems
- Recent advances in optimization techniques for statistical tabular data protection
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- Solving Real-World Linear Programs: A Decade and More of Progress
- Solving difficult multicommodity problems with a specialized interior-point algorithm
- Splittings of symmetric matrices and a question of Ortega
- The Lanczos and Conjugate Gradient Algorithms
- Using the primal-dual interior point algorithm within the branch-price-and-cut method
Cited in
(11)- On solving large-scale multistage stochastic optimization problems with a new specialized interior-point approach
- An interior-point approach for primal block-angular problems
- Interior Point Methods Can Exploit Structure of Convex Piecewise Linear Functions with Application in Radiation Therapy
- Improving an interior-point approach for large block-angular problems by hybrid preconditioners
- On geometrical properties of preconditioners in IPMs for classes of block-angular problems
- A new interior-point approach for large separable convex quadratic two-stage stochastic problems
- A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
- On three approaches to length-bounded maximum multicommodity flow with unit edge-lengths
- Design and implementation of a modular interior-point solver for linear optimization
- New interior-point approach for one- and two-class linear support vector machines using multiple variable splitting
- A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method
This page was built for publication: Interior-point solver for convex separable block-angular problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811483)
