Quadratic regularizations in an interior-point method for primal block-angular problems
From MaRDI portal
Publication:652285
DOI10.1007/s10107-010-0341-2zbMath1229.90086OpenAlexW1993695198MaRDI QIDQ652285
Publication date: 14 December 2011
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2117/14412
interior-point methodspreconditioned conjugate gradientregularizationslarge-scale computational optimizationmulticommodity network flowsprimal block-angular 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 (22)
Improving an interior-point algorithm for multicommodity flows by quadratic regularizations ⋮ A new interior-point approach for large separable convex quadratic two-stage stochastic problems ⋮ Inexact coordinate descent: complexity and preconditioning ⋮ Mathematical programming approaches for classes of random network problems ⋮ A comparison of reduced and unreduced KKT systems arising from interior point methods ⋮ Perspective Reformulations of the CTA Problem with L2 Distances ⋮ Existence, uniqueness, and convergence of the regularized primal-dual central path ⋮ On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems ⋮ A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme ⋮ An infeasible interior-point algorithm for stochastic second-order cone optimization ⋮ On solving large-scale multistage stochastic optimization problems with a new specialized interior-point approach ⋮ Recent advances in optimization techniques for statistical tabular data protection ⋮ Matrix-free interior point method ⋮ Solving \( L_1\)-CTA in 3D tables by an interior-point method for primal block-angular problems ⋮ Interior point methods 25 years later ⋮ Accelerated multigrid for graph Laplacian operators ⋮ A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method ⋮ A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks ⋮ Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC ⋮ Interior-point solver for convex separable block-angular problems ⋮ Block preconditioners for linear systems in interior point methods for convex constrained optimization ⋮ Improving an interior-point approach for large block-angular problems by hybrid preconditioners
Uses Software
Cites Work
- Convergence behavior of interior-point algorithms
- Interior proximal point algorithm for linear programs
- Parallel interior-point solver for structured linear programs
- Introductory lectures on convex optimization. A basic course.
- Solving difficult multicommodity problems with a specialized interior-point algorithm
- Potential function methods for approximately solving linear programming problems: theory and practice.
- Augmented self-concordant barriers and nonlinear optimization problems with finite complexity
- 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
- Quadratic interior-point methods in statistical disclosure control
- An interior-point approach for primal block-angular problems
- Regularization and preconditioning of KKT systems arising in nonnegative least-squares problems
- A Survey of Algorithms for Convex Multicommodity Flow Problems
- Solving Large-Scale Linear Multicommodity Flow Problems with an Active Set Strategy and Proximal-ACCPM
- Solving Real-World Linear Programs: A Decade and More of Progress
- Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems
- Monotone Operators and the Proximal Point Algorithm
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
- A Bundle Type Dual-Ascent Approach to Linear Multicommodity Min-Cost Flow Problems
- Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
- PCx: an interior-point code for linear programming
- A Specialized Interior-Point Algorithm for Multicommodity Network Flows
- Symmetric Quasidefinite Matrices
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Quadratic regularizations in an interior-point method for primal block-angular problems
