On practical conditions for the existence and uniqueness of solutions to the general equality quadratic programming problem
From MaRDI portal
Publication:3720303
DOI10.1007/BF01585660zbMath0591.90068OpenAlexW2106353864MaRDI QIDQ3720303
Publication date: 1985
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01585660
existenceuniquenessequality constraintsLagrangian methodinertiastationary pointsnull-space methodsrange-space methods
Related Items
An inertia-free filter line-search algorithm for large-scale nonlinear programming, Unnamed Item, Computing the nearest low-rank correlation matrix by a simplified SQP algorithm, 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, Domain decomposition methods for advection-dominated linear-quadratic elliptic optimal control problems, Complexity of an algorithm for solving saddle-point systems with singular blocks arising in wavelet-Galerkin discretizations., An Interior-Point $$\boldsymbol{\ell_{1}}$$ -Penalty Method for Nonlinear Optimization, Primal-dual active-set algorithm for chemical equilibrium problems related to the modeling of atmospheric inorganic aerosols, Convergence analysis of a regularized interior point algorithm for the barrier problems with singular solutions, Unnamed Item, A generalization of the Riccati recursion for equality‐constrained linear quadratic optimal control, Formulas for calculating the extremum ranks and inertias of a four-term quadratic matrix-valued function and their applications, A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties, Solving optimization problems on ranks and inertias of some constrained nonlinear matrix functions via an algebraic linearization method, An algorithm for solving the indefinite least squares problem with equality constraints, Some iterative methods for the solution of a symmetric indefinite KKT system, A Regularized Factorization-Free Method for Equality-Constrained Optimization, Equalities and inequalities for inertias of Hermitian matrices with applications, Unnamed Item, An optimization problem related to the modeling of atmospheric inorganic aerosols., On solving trust-region and other regularised subproblems in optimization, Convergence theory for nonconvex stochastic programming with an application to mixed logit, Natural Preconditioning and Iterative Methods for Saddle Point Systems, An inexact Newton method combined with Hestenes multipliers' scheme for the solution of Karush-Kuhn-Tucker systems, Huber approximation for the non-linear \(l_{1}\) problem, Modifying the inertia of matrices arising in optimization, ABS algorithms for linear equations and optimization, From global to local convergence of interior methods for nonlinear optimization, Inertia-controlling factorizations for optimization algorithms, An iterative working-set method for large-scale nonconvex quadratic programming, Constraint deletion strategy in the inertia-controlling quadratic programming method, Methods for convex and general quadratic programming
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A computational method for the indefinite quadratic programming problem
- On the definity of quadratic forms subject to linear constraints
- Factorizing symmetric indefinite matrices
- A modified Newton method for minimization
- Algorithmic equivalence in quadratic programming. I. A least-distance programming problem
- Manifestations of the Schur complement
- Determination of the inertia of a partitioned Hermitian matrix
- Curvilinear path steplength algorithms for minimization which use directions of negative curvature
- Partial pivoting strategies for symmetric gaussian elimination
- Some Stable Methods for Calculating Inertia and Solving Symmetric Linear Systems
- Numerically stable methods for quadratic programming
- On the use of directions of negative curvature in a modified newton method
- Direct Solution of Sets of Linear Equations whose Matrix is Sparse, Symmetric and Indefinite
- Stationary points of quadratic functions under linear constraints
- Definite and Semidefinite Quadratic Forms
- Quadratic Forms with Linear Constraints
