Using the KKT matrix in an augmented Lagrangian SQP method for sparse constrained optimization
type: Item
instance of: scholarly article
title: Using the KKT matrix in an augmented Lagrangian SQP method for sparse constrained optimization
zbMATH Open document ID: 0823.90110
DOI: 10.1007/BF02192305
author: M. de F. G. Hernandez
author: Michael Bartholomew-Biggs
published in: Journal of Optimization Theory and Applications
publication date: 1995-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C30
Mathematics Subject Classification ID: 90-08
Mathematics Subject Classification ID: 65K05
Mathematics Subject Classification ID: 90C20
zbMATH DE Number: 769822
zbMATH Keywords: sequential quadratic programming
zbMATH Keywords: constrained optimization
zbMATH Keywords: sparse data structures
describes a project that uses: MA27
describes a project that uses: LANCELOT
describes a project that uses: OPALQP
MaRDI profile type: Publication
cites work: A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
cites work: Solving Large Sparse Nonlinear Programs Using GRG
cites work: Recursive quadratic programming methods based on the augmented lagrangian
cites work: Local convergence analysis for the REQP algorithm using conjugate basis matrices
cites work: Modifications to the subroutine OPALQP for dealing with large problems
cites work: On Sparse and Symmetric Matrix Updating Subject to a Linear Equation
cites work: A note about sparsity exploiting quasi-Newton updates
cites work: An Optimal Positive Definite Update for Sparse Hessian Matrices
cites work: The Factorization of Sparse Symmetric Indefinite Matrices
cites work: A New Modified Cholesky Factorization
cites work: Newton Methods for Large-Scale Linear Equality-Constrained Minimization
cites work: On the Accurate Determination of Search Directions for Simple Differentiable Penalty Functions
Recommended article: Augmented Lagrangian methods for convex matrix optimization problems
Recommended article: Q4362946
Recommended article: On Convergence of an Augmented Lagrangian Decomposition Method for Sparse Convex Optimization
Recommended article: Q3130999
Recommended article: An augmented Lagrangian proximal alternating method for sparse discrete optimization problems
Recommended article: An SQP Augmented Lagrangian BFGS Algorithm for Constrained Optimization
Recommended article: Towards an efficient augmented Lagrangian method for convex quadratic programming
Recommended article: Q5058515
Recommended article: A partial parallel splitting augmented Lagrangian method for solving constrained matrix optimization problems
Recommended article: On Relaxed Greedy Randomized Augmented Kaczmarz Methods for Solving Large Sparse Inconsistent Linear Systems
description: scientific article; zbMATH DE number 769822