scientific article
From MaRDI portal
Publication:3978055
zbMath0746.90048MaRDI QIDQ3978055
Publication date: 25 June 1992
Full work available at URL: https://eudml.org/doc/27672
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Large-scale problems in mathematical programming (90C06) Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Large sparse numerical optimization
- Direct methods for sparse matrices
- Experiments with successive quadratic programming algorithms
- A survey of the advances in the exploitation of the sparsity in the solution of large problems
- Test examples for nonlinear programming codes
- The Elimination form of the Inverse and its Application to Linear Programming
- Truncated-Newton algorithms for large-scale unconstrained optimization
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- Dealing with degeneracy in reduced gradient algorithms
- Projected gradient methods for linearly constrained problems
- A primal truncated newton algorithm with application to large-scale nonlinear network optimization
- The computation of Lagrange-multiplier estimates for constrained minimization
- A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
- Inexact Newton Methods
- A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
- Newton-type methods for unconstrained and linearly constrained optimization
- Large-scale linearly constrained optimization
- New Finite Pivoting Rules for the Simplex Method
This page was built for publication:
