Symmetric Quasidefinite Matrices
From MaRDI portal
Publication:4764310
DOI10.1137/0805005zbMath0822.65017OpenAlexW2075998338MaRDI QIDQ4764310
Publication date: 15 October 1995
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0805005
stabilitylinear programmingnumerical resultsquadratic programminginterior-point methodsfactorizationtest problemsindefinite systemsquasidefinite matrices
Numerical mathematical programming methods (65K05) Quadratic programming (90C20) Linear programming (90C05) Direct numerical methods for linear systems and matrix inversion (65F05)
Related Items
A regularized interior-point method for constrained linear least squares, A Schur complement approach to preconditioning sparse linear least-squares problems with some dense rows, Sparse Approximations with Interior Point Methods, Preconditioning Linear Least-Squares Problems by Identifying a Basis Matrix, Conic optimization via operator splitting and homogeneous self-dual embedding, The practical behavior of the homogeneous self-dual formulations in interior point methods, On the strong \(P\)-regular splitting iterative methods for non-Hermitian linear systems, On mutual impact of numerical linear algebra and large-scale optimization with focus on interior point methods, Linear systems arising in interior methods for convex optimization: a symmetric formulation with bounded condition number, Primal-dual nonlinear rescaling method for convex optimization, Application of lower bound direct method to engineering structures, Inner solvers for interior point methods for large scale nonlinear programming, Preconditioning and iterative solution of symmetric indefinite linear systems arising from interior point methods for linear programming, Detecting ``dense columns in interior point methods for linear programs, An infeasible interior-point algorithm for solving primal and dual geometric programs, Solution of sparse rectangular systems using LSQR and Craig, FBstab: a proximally stabilized semismooth algorithm for convex quadratic programming, General-purpose preconditioning for regularized interior point methods, CVXGEN: a code generator for embedded convex optimization, A selective strategy for shakedown analysis of engineering structures, On Using Cholesky-Based Factorizations and Regularization for Solving Rank-Deficient Sparse Linear Least-Squares Problems, Dynamic non-diagonal regularization in interior point methods for linear and convex quadratic programming, An interior point method for nonlinear optimization with a quasi-tangential subproblem, A regularization method for constrained nonlinear least squares, Solving multiobjective environmentally friendly and economically feasible electric power distribution problem by primal-dual interior-point method, An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems, A Newton-Type Globally Convergent Interior-Point Method To Solve Multi-Objective Optimization Problems, Preconditioning indefinite systems in interior point methods for large scale linear optimisation, Regularization techniques in interior point methods, Interior point methods 25 years later, Perturbation analysis for block downdating of the generalized Cholesky factorization, Quadratic regularizations in an interior-point method for primal block-angular problems, Backward stability analysis of weighted linear least-squares problems, Parameter Selection and Preconditioning for a Graph Form Solver, 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, Implementing a Smooth Exact Penalty Function for Equality-Constrained Nonlinear Optimization, Perturbation theory for the eigenvalues of factorised symmetric matrices, Rounding-error and perturbation bounds for the indefinite QR factorization, Algebra -- 9. Translated from the Russian, A sparse proximal implementation of the LP dual active set algorithm, A Regularized Factorization-Free Method for Equality-Constrained Optimization, An adaptively regularized sequential quadratic programming method for equality constrained optimization, Bitopological spaces, Parallel interior-point solver for structured quadratic programs: Application to financial planning problems, 1.5-\(Q\)-superlinear convergence of an exterior-point method for constrained optimization, A primal-dual regularized interior-point method for convex quadratic programs, A new class of preconditioners for large-scale linear systems from interior point methods for linear programming, OSQP: An Operator Splitting Solver for Quadratic Programs, Primal-dual nonlinear rescaling method with dynamic scaling parameter update, A note on the perturbation analysis for the generalized Cholesky factorization, Exploiting structure in parallel implementation of interior point methods for optimization, The factorability of symmetric matrices and some implications for statistical linear models, A primal-dual interior-point algorithm for quadratic programming, An interior point-proximal method of multipliers for convex quadratic programming, Computational experience with a modified potential reduction algorithm for linear programming, Block splitting for distributed optimization, Principal Pivot Transforms of Quasidefinite Matrices and Semidefinite Lagrangian Subspaces, Limited-memory LDL\(^{\top}\) factorization of symmetric quasi-definite matrices with application to constrained optimization, An interior point potential reduction method for constrained equations, Optimal representative sample weighting, Solving quadratically constrained convex optimization problems with an interior-point method, Perturbation analysis of saddle-point problems, Correlative sparsity in primal-dual interior-point methods for LP, SDP, and SOCP, LNLQ: An Iterative Method for Least-Norm Problems with an Error Minimization Property, High-performance sampling of generic determinantal point processes, Investigations in topology. 9. Work collection, Conditionally definite matrices, Bitopologies on products and ratios, Boundedness of the inverse of a regularized Jacobian matrix in constrained optimization and applications, LSLQ: An Iterative Method for Linear Least-Squares with an Error Minimization Property, Parameter modified versions of preconditioning and iterative inner product free refinement methods for two-by-two block matrices, \texttt{Tenscalc}: a toolbox to generate fast code to solve nonlinear constrained minimizations and compute Nash equilibria, QPALM: a proximal augmented Lagrangian method for nonconvex quadratic programs, Sparsity in convex quadratic programming with interior point methods, <scp>TriCG</scp> and <scp>TriMR</scp>: Two Iterative Methods for Symmetric Quasi-definite Systems, Operator Splitting for a Homogeneous Embedding of the Linear Complementarity Problem, An exterior point polynomial-time algorithm for convex quadratic programming, Cholesky-Like Factorization of Symmetric Indefinite Matrices and Orthogonalization with Respect to Bilinear Forms, Modifying the inertia of matrices arising in optimization, Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization, The BPMPD interior point solver for convex quadratic problems, LOQO:an interior point code for quadratic programming, Inertia-controlling factorizations for optimization algorithms, A primal–dual regularized interior-point method for semidefinite programming, On a primal-dual Newton proximal method for convex quadratic programs
Uses Software
