eCommons

 

Solution of Definite Quadratic Programming Problems

Other Titles

Abstract

A algorithm for solving the definite quadratic programming problem is presented. An implementation of this algorithm in FORTRAN is discussed. Numerical tests of this algorithm and a similar one not using the positive definiteness property show the former to be more stable. This algorithm is paarticularly suited for numerical methods for solving general nonlinear programming problems or minimax problems.

Journal / Series

Volume & Issue

Description

Sponsorship

Date Issued

1978-05

Publisher

Cornell University

Keywords

computer science; technical report

Location

Effective Date

Expiration Date

Sector

Employer

Union

Union Local

NAICS

Number of Workers

Committee Chair

Committee Co-Chair

Committee Member

Degree Discipline

Degree Name

Degree Level

Related Version

Related DOI

Related To

Related Part

Based on Related Item

Has Other Format(s)

Part of Related Item

Related To

Related Publication(s)

Link(s) to Related Publication(s)

References

Link(s) to Reference(s)

Previously Published As

http://techreports.library.cornell.edu:8081/Dienst/UI/1.0/Display/cul.cs/TR78-341

Government Document

ISBN

ISMN

ISSN

Other Identifiers

Rights

Rights URI

Types

technical report

Accessibility Feature

Accessibility Hazard

Accessibility Summary

Link(s) to Catalog Record