scientific article; zbMATH DE number 13594

zbMATH Open0746.90048MaRDI QIDQ3978055FDOQ3978055

Authors: Miroslav Tuma 

Publication date: 25 June 1992

Full work available at URL: https://eudml.org/doc/27672

Title of this publication is not available (Why is that?)

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

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)

Cites Work

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

Cited In (8)

• A primal-dual interior-point algorithm for quadratic programming
• Title not available (Why is that?)
• Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems
• A feasible descent decomposition algorithm for large-scale quadratic programming
• A decomposition algorithm for solving large-scale quadratic programming problems
• Title not available (Why is that?)
• Efficient Algorithms for Large-Scale Quadratic Matrix Equations
• A direct active set algorithm for large sparse quadratic programs with simple bounds

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)