Further development of multiple centrality correctors for interior point methods
From MaRDI portal
Publication:1029632
DOI10.1007/s10589-007-9106-0zbMath1168.90643OpenAlexW2104414266WikidataQ64457966 ScholiaQ64457966MaRDI QIDQ1029632
Publication date: 13 July 2009
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://www.pure.ed.ac.uk/ws/files/10365265/Further_development_of_multiple_centrality_correctors_for_interior_point_methods.pdf
higher order methodsimplementation of interior point methodsmultiple centrality correctorssymmetric neighbourhood
Related Items
An \(O(\sqrt{n}L)\) iteration Mehrotra-type predictor-corrector algorithm for monotone linear complementarity problem, Interior Point Methods Can Exploit Structure of Convex Piecewise Linear Functions with Application in Radiation Therapy, Using the primal-dual interior point algorithm within the branch-price-and-cut method, A computational study of a solver system for processing two-stage stochastic LPs with enhanced Benders decomposition, Trajectory-following methods for large-scale degenerate convex quadratic programming, Projected orthogonal vectors in two-dimensional search interior point algorithms for linear programming, Interior/exterior-point methods with inertia correction strategy for solving optimal reactive power flow problems with discrete variables, A New Stopping Criterion for Krylov Solvers Applied in Interior Point Methods, Optimized choice of parameters in interior-point methods for linear programming, Recycling basic columns of the splitting preconditioner in interior point methods, Proximal stabilized interior point methods and \textit{low-frequency-update} preconditioning techniques, Matrix-free interior point method, A constraint-reduced variant of Mehrotra's predictor-corrector algorithm, Interior point methods 25 years later, A predictor-corrector algorithm with multiple corrections for convex quadratic programming, Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods, A new warmstarting strategy for the primal-dual column generation method, A massively parallel interior-point solver for LPs with generalized arrowhead structure, and applications to energy system models, Interior Point Methods for Nonlinear Optimization, A variation on the interior point method for linear programming using the continued iteration, Mehrotra-type predictor-corrector algorithms for sufficient linear complementarity problem, A warm-start approach for large-scale stochastic linear programs, Quasi-Newton approaches to interior point methods for quadratic problems, Material-separating regularizer for multi-energy x-ray tomography
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some disadvantages of a Mehrotra-type primal-dual corrector interior point algorithm for linear programming
- HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
- A primal-dual interior point method whose running time depends only on the constraint matrix
- Multiple centrality corrections in a primal-dual method for linear programming
- On Mehrotra-Type Predictor-Corrector Algorithms
- On the Implementation of a Primal-Dual Interior Point Method
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives
- On Adaptive-Step Primal-Dual Interior-Point Algorithms for Linear Programming
- Extending Mehrotra and Gondzio higher order methods to mixed semidefinite-quadratic-linear programming
- The Mehrotra Predictor-Corrector Interior-Point Method As a Perturbed Composite Newton Method
- Convergence Conditions and Krylov Subspace--Based Corrections for Primal-Dual Interior-Point Method
- Benchmarking optimization software with performance profiles.
