Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization
From MaRDI portal
Publication:4504784
DOI10.1080/10556789908805754zbMath0957.90101OpenAlexW2049219350MaRDI QIDQ4504784
Publication date: 14 September 2000
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556789908805754
linear programmingconvex quadratic programmingprimal-dual interior point algorithmmultiple centrality correctorsprimal-dual regularizationsymmetric quasidefinite systems
Related Items
Solving security constrained optimal power flow problems by a structure exploiting interior point method, Estimation of bivariate probability distributions of nanoparticle characteristics, based on univariate measurements, Improving an interior-point algorithm for multicommodity flows by quadratic regularizations, Sparse Approximations with Interior Point Methods, Interior point method for long-term generation scheduling of large-scale hydrothermal systems, Primal and dual active-set methods for convex quadratic programming, Efficient Preconditioners for Interior Point Methods via a New Schur Complement-Based Strategy, Application of lower bound direct method to engineering structures, Inner solvers for interior point methods for large scale nonlinear programming, Using a hybrid preconditioner for solving large-scale linear systems arising from interior point methods, Improving the preconditioning of linear systems from interior point methods, A comparison of reduced and unreduced KKT systems arising from interior point methods, A polynomial arc-search interior-point algorithm for linear programming, Existence, uniqueness, and convergence of the regularized primal-dual central path, A New Stopping Criterion for Krylov Solvers Applied in Interior Point Methods, General-purpose preconditioning for regularized interior point methods, Stability and accuracy of inexact interior point methods for convex quadratic programming, A constraint-reduced MPC algorithm for convex quadratic programming, with a modified active set identification scheme, Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming, A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic programming, Proximal stabilized interior point methods and \textit{low-frequency-update} preconditioning techniques, A polynomial arc-search interior-point algorithm for convex quadratic programming, Preconditioning indefinite systems in interior point methods for large scale linear optimisation, Matrix-free interior point method, Interior point methods 25 years later, A preconditioning technique for Schur complement systems arising in stochastic optimization, Quadratic regularizations in an interior-point method for primal block-angular problems, Fast quadratic programming for mean-variance portfolio optimisation, On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods, Some iterative methods for the solution of a symmetric indefinite KKT system, On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems, Combining a hybrid preconditioner and a optimal adjustment algorithm to accelerate the convergence of interior point methods, Factorization of saddle-point matrices in dynamical systems optimization -- reusing pivots, Regularization and preconditioning of KKT systems arising in nonnegative least-squares problems, Solving large-scale optimization problems related to Bell's theorem, A primal-dual regularized interior-point method for convex quadratic programs, Exploiting separability in large-scale linear support vector machine training, Exploiting structure in parallel implementation of interior point methods for optimization, An interior point-proximal method of multipliers for convex quadratic programming, Local convergence analysis of a primal-dual method for bound-constrained optimization without SOSC, The parallel solution of dense saddle-point linear systems arising in stochastic programming, Interior-point solver for convex separable block-angular problems, A predictor-corrector affine scaling method to train optimized extreme learning machine, An interior point-proximal method of multipliers for linear positive semi-definite programming, Quasi-Newton approaches to interior point methods for quadratic problems, Block preconditioners for linear systems in interior point methods for convex constrained optimization, <scp>TriCG</scp> and <scp>TriMR</scp>: Two Iterative Methods for Symmetric Quasi-definite Systems, An exterior point polynomial-time algorithm for convex quadratic programming, From global to local convergence of interior methods for nonlinear optimization, Improving an interior-point approach for large block-angular problems by hybrid preconditioners, Active-set prediction for interior point methods using controlled perturbations
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the augmented system approach to sparse least-squares problems
- HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
- Cost-effective sulphur emission reduction under uncertainty
- Interior proximal point algorithm for linear programs
- Solving symmetric indefinite systems in an interior-point method for linear programming
- QHOPDM -- a higher order primal-dual method for large scale convex quadratic programming
- Symmetric indefinite systems for interior point methods
- Implementing cholesky factorization for interior point methods of linear programming
- On the Implementation of a Primal-Dual Interior Point Method
- On Implementing Mehrotra’s Predictor–Corrector Interior-Point Method for Linear Programming
- Augmented Lagrangians and Applications of the Proximal Point Algorithm in Convex Programming
- Higher-Order Predictor-Corrector Interior Point Methods with Application to Quadratic Objectives
- LOQO:an interior point code for quadratic programming
- A repository of convex quadratic programming problems
- Solving Sparse Linear Systems with Sparse Backward Error
- Symmetric Quasidefinite Matrices
