A numerically stable reduced-gradient type algorithm for solving large- scale linearly constrained minimization problems
From MaRDI portal
Publication:2638951
DOI10.1016/0305-0548(91)90038-SzbMath0717.90069OpenAlexW2026255417MaRDI QIDQ2638951
Herminio Simões Gomes, José Mario Martínez
Publication date: 1991
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(91)90038-s
orthogonal transformationslarge-scale linearly constrained minimizationreduced-gradient type algorithm
Large-scale problems in mathematical programming (90C06) Nonlinear programming (90C30) Methods of reduced gradient type (90C52) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the eigenvalue distribution of a class of preconditioning methods
- Augmentability in optimization theory
- Computational experience with conjugate gradient algorithms
- Solution of sparse linear least squares problems using Givens rotations
- A generalized conjugate gradient algorithm for solving a class of quadratic programming problems
- Optimization with staircase structure: An application to generation scheduling
- An algorithm for solving sparse nonlinear least squares problems
- A stabilization of the simplex method
- An algorithm that minimizes homogeneous functions of \(n\) variables in \(n + 2\) iterations and rapidly minimizes general functions
- An approach to nonlinear programming
- On projected newton barrier methods for linear programming and an equivalence to Karmarkar’s projective method
- Staircase Matrices and Systems
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- Tensor Methods for Unconstrained Optimization Using Second Derivatives
- A numerically stable optimization method based on A homogeneous function
- Large-scale linearly constrained optimization
- Projected Newton Methods for Optimization Problems with Simple Constraints
- Least Squares Computations by Givens Transformations Without Square Roots
- Function minimization by conjugate gradients
- The simplex method of linear programming using LU decomposition
- Methods of conjugate gradients for solving linear systems
