scientific article; zbMATH DE number 13594

MaRDI QIDQ3978055zbMATH OpenFDO

Authors Miroslav Tuma

Publication date 25 June 1992

Full work available at URL https://eudml.org/doc/27672, http://www.kybernetika.cz/content/1991/2/155

zbMATH Keywords

active set strategytruncated Newton methodreduced gradient methodsprimal feasible algorithm

Mathematics Subject Classification ID

Quadratic programming (90C20) Large-scale problems in mathematical programming (90C06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• An Algorithm for Large-Scale Quadratic Programming
• A primal-dual interior-point algorithm for quadratic programming
• A feasible descent decomposition algorithm for large-scale quadratic programming
• A decomposition algorithm for solving large-scale quadratic programming problems
• Optimal algorithms for large sparse quadratic programming problems with uniformly bounded spectrum

Cites work

• scientific article; zbMATH DE number 3833697 (Why is no real title available?)
• scientific article; zbMATH DE number 3852305 (Why is no real title available?)
• scientific article; zbMATH DE number 3744430 (Why is no real title available?)
• scientific article; zbMATH DE number 3405087 (Why is no real title available?)
• A primal truncated newton algorithm with application to large-scale nonlinear network optimization
• A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
• A sparsity-exploiting variant of the Bartels—Golub decomposition for linear programming bases
• A survey of the advances in the exploitation of the sparsity in the solution of large problems
• CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
• Dealing with degeneracy in reduced gradient algorithms
• Direct methods for sparse matrices
• Experiments with successive quadratic programming algorithms
• Inexact Newton Methods
• Large sparse numerical optimization
• Large-scale linearly constrained optimization
• New Finite Pivoting Rules for the Simplex Method
• Newton-type methods for unconstrained and linearly constrained optimization
• Projected gradient methods for linearly constrained problems
• Test examples for nonlinear programming codes
• The computation of Lagrange-multiplier estimates for constrained minimization
• The elimination form of the inverse and its application to linear programming
• Truncated-Newton algorithms for large-scale unconstrained optimization

Cited in

(8)

• Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
• A primal-dual interior-point algorithm for quadratic programming
• A decomposition algorithm for solving large-scale quadratic programming problems
• Efficient Algorithms for Large-Scale Quadratic Matrix Equations
• A feasible descent decomposition algorithm for large-scale quadratic programming
• scientific article; zbMATH DE number 4152153 (Why is no real title available?)
• scientific article; zbMATH DE number 5270607 (Why is no real title available?)
• A direct active set algorithm for large sparse quadratic programs with simple bounds

Describes a project that uses

Uses Software

• CONOPT
• MINOS
• NLPNET

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3978055)