An interior-point approach for primal block-angular problems
From MaRDI portal
Publication:2643610
DOI10.1007/s10589-006-9000-1zbMath1148.90351OpenAlexW2147811035MaRDI QIDQ2643610
Publication date: 27 August 2007
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-006-9000-1
Interior-point methodsLarge-scale optimizationStructured problemsNormal equationsPreconditioned conjugate gradient
Related Items (15)
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 ⋮ Mathematical programming approaches for classes of random network problems ⋮ On Geometrical Properties of Preconditioners in IPMs for Classes of Block-Angular Problems ⋮ 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 ⋮ Solving \( L_1\)-CTA in 3D tables by an interior-point method for primal block-angular problems ⋮ Quadratic regularizations in an interior-point method for primal block-angular problems ⋮ A cutting-plane approach for large-scale capacitated multi-period facility location using a specialized interior-point method ⋮ JuMP: A Modeling Language for Mathematical Optimization ⋮ Optimal admissible composition of abstraction heuristics ⋮ Dantzig-Wolfe and block coordinate-descent decomposition in large-scale integrated refinery-planning ⋮ Interior-point solver for convex separable block-angular problems ⋮ Improving an interior-point approach for large block-angular problems by hybrid preconditioners
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Solving a class of LP problems with a primal-dual logarithmic barrier method
- Linear programming: foundations and extensions
- 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
- Exploiting structure in parallel implementation of interior point methods for optimization
- Quadratic interior-point methods in statistical disclosure control
- Minimum-distance controlled perturbation methods for large-scale tabular data protection
- A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem
- An Implementation of the Dual Affine Scaling Algorithm for Minimum-Cost Flow on Bipartite Uncapacitated Networks
- The maximum concurrent flow problem
- Solving Real-World Linear Programs: A Decade and More of Progress
- Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems
- Solving large-scale linear programs by interior-point methods under the Matlab∗Environment†
- Block Sparse Cholesky Algorithms on Advanced Uniprocessor Computers
- A Specialized Interior-Point Algorithm for Multicommodity Network Flows
- Adaptive use of iterative methods in predictor-corrector interior point methods for linear programming
This page was built for publication: An interior-point approach for primal block-angular problems
