On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
From MaRDI portal
Publication:2379689
DOI10.1007/s10589-008-9226-1zbMath1187.90194OpenAlexW2058696262WikidataQ58832841 ScholiaQ58832841MaRDI QIDQ2379689
Daniela di Serafino, Valentina De Simone, Marco D'apuzzo
Publication date: 19 March 2010
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.416.4113
Related Items
Sparse Approximations with Interior Point Methods ⋮ Preconditioning of Active-Set Newton Methods for PDE-constrained Optimal Control Problems ⋮ A robust and efficient proposal for solving linear systems arising in interior-point methods for linear programming ⋮ On preconditioner updates for sequences of saddle-point linear systems ⋮ Crash start of interior point methods ⋮ Shifted L-BFGS systems ⋮ On the update of constraint preconditioners for regularized KKT systems ⋮ A comparison of reduced and unreduced KKT systems arising from interior point methods ⋮ Interior/exterior-point methods with inertia correction strategy for solving optimal reactive power flow problems with discrete variables ⋮ Efficiently preconditioned inexact Newton methods for large symmetric eigenvalue problems ⋮ Updating Constraint Preconditioners for KKT Systems in Quadratic Programming Via Low-Rank Corrections ⋮ 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 ⋮ Spectral estimates for unreduced symmetric KKT systems arising from Interior Point methods ⋮ A structured modified Newton approach for solving systems of nonlinear equations arising in interior-point methods for quadratic 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 relaxed generalized-PSS preconditioner for saddle-point linear systems from steady incompressible Navier-Stokes equations ⋮ Interior point methods 25 years later ⋮ A preconditioning technique for Schur complement systems arising in stochastic optimization ⋮ Switching preconditioners using a hybrid approach for linear systems arising from interior point methods for linear programming ⋮ A combined SQP-IPM algorithm for solving large-scale nonlinear optimization problems ⋮ A specialized primal-dual interior point method for the plastic truss layout optimization ⋮ Null-Space Preconditioners for Saddle Point Systems ⋮ Quasi-Newton approaches to interior point methods for quadratic problems ⋮ Implementation of interior-point methods for LP based on Krylov subspace iterative solvers with inner-iteration preconditioning ⋮ Block preconditioners for linear systems in interior point methods for convex constrained optimization
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- HOPDM (version 2. 12) -- a fast LP solver based on a primal-dual interior point method
- QMR: A quasi-minimal residual method for non-Hermitian linear systems
- Computational results of an interior point algorithm for large scale linear programming
- Factorizing symmetric indefinite matrices
- An interior point method for quadratic programs based on conjugate projected gradients
- An interior-point algorithm for nonconvex nonlinear programming
- Modifying the inertia of matrices arising in optimization
- A QMR-based interior-point algorithm for solving linear programs
- Inexact interior-point method
- Symbiosis between linear algebra and optimization
- A primal-dual trust-region algorithm for non-convex nonlinear programming
- A new class of preconditioners for large-scale linear systems from interior point methods for linear programming
- Inertia-controlling factorizations for optimization algorithms
- Preconditioning techniques for large linear systems: A survey
- Preconditioning indefinite systems in interior point methods for optimization
- Software for simplified Lanczos and QMR algorithms
- Exploiting structure in parallel implementation of interior point methods for optimization
- Interior-point solver for large-scale quadratic programming problems with bound constraints
- On the iterative solution of KKT systems in potential reduction software for large-scale quadratic problems
- Parallel interior-point solver for structured quadratic programs: Application to financial planning problems
- Convergence analysis of an inexact potential reduction method for convex quadratic programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- On the eigenvalues of a class of saddle point matrices
- Inexact constraint preconditioners for linear systems arising in interior point methods
- Using constraint preconditioners with regularized saddle-point problems
- Stopping criteria for inner iterations in inexact potential reduction methods: a computational study
- On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- Truncated-Newton algorithms for large-scale unconstrained optimization
- Stability of Augmented System Factorizations in Interior-Point Methods
- Preconditioning of Indefinite Problems by Regularization
- Recent computational developments in Krylov subspace methods for linear systems
- Interior‐point method for non‐linear non‐convex optimization
- Numerical solution of saddle point problems
- Numerical methods for large-scale nonlinear optimization
- Iterative Solution of Augmented Systems Arising in Interior Methods
- The Multifrontal Solution of Indefinite Sparse Symmetric Linear
- On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Inexact Newton Methods
- On the Identification of Local Minimizers in Inertia-Controlling Methods for Quadratic Programming
- Preconditioners for Indefinite Systems Arising in Optimization
- Implementations of Affine Scaling Methods: Approximate Solutions of Systems of Linear Equations Using Preconditioned Conjugate Gradient Methods
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- Ill-Conditioning and Computational Error in Interior Methods for Nonlinear Programming
- Accurate Symmetric Indefinite Linear Equation Solvers
- Numerical Optimization
- Fast Iterative Solution of Stabilised Stokes Systems Part II: Using General Block Preconditioners
- LOQO:an interior point code for quadratic programming
- Constraint Preconditioning for Indefinite Linear Systems
- Solving the Trust-Region Subproblem using the Lanczos Method
- A Revised Modified Cholesky Factorization Algorithm
- Incomplete Cholesky Factorizations with Limited Memory
- Infeasible-Interior-Point Primal-Dual Potential-Reduction Algorithms for Linear Programming
- Symmetric Quasidefinite Matrices
- Krylov Subspace Methods for Saddle Point Problems with Indefinite Preconditioning
- Interior Methods for Nonlinear Optimization
- Block-diagonal and indefinite symmetric preconditioners for mixed finite element formulations
- Constraint-Style Preconditioners for Regularized Saddle Point Problems
- Preconditioning methods for linear systems arising in constrained optimization problems
- Indefinitely preconditioned conjugate gradient method for large sparse equality and inequality constrained quadratic problems
- Object-oriented software for quadratic programming
- Approximate Factorization Constraint Preconditioners for Saddle-Point Matrices
- Implicit-Factorization Preconditioning and Iterative Solvers for Regularized Saddle-Point Systems
- Large-Scale Scientific Computing
This page was built for publication: On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods
