A Dual Quadratic Programming Algorithm.

Abstract

By using conjugate directions a method for solving convex quadratic programming problems is developed. The algorithm generates a sequence of dual feasible solutions and terminates after a finite number of steps. Originator-supplied keywords include: Duality and Optimization.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1984
Accession Number
ADA147237

Entities

People

  • K. Ritter

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Abstracts
  • Algorithms
  • Contracts
  • Equations
  • Evolutionary Algorithms
  • Inequalities
  • Linear Algebra
  • Mathematical Programming
  • Mathematics
  • North Carolina
  • Optimization
  • Quadratic Programming
  • Security
  • Sequences
  • United States
  • Universities
  • Wisconsin

Fields of Study

  • Mathematics

Readers

  • Applied Combinatorial Optimization and Logic Circuit Design.
  • Graph Algorithms and Convex Optimization.