Finite Algorithms for Solving Quasi-Convex Quadratic Programs

Abstract

The paper considers the question of why some convex quadratic programming algorithms fail and others succeed when applied to nonconvex quasi-convex quadratic programs. Several algorithms are identified as being capable of solving quasi-convex quadratic programs using only a finite number of arithmetic and logical operations. These algorithms are all primal feasible, pivot algorithms.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
May 01, 1971
Accession Number
AD0740827

Entities

People

  • W. C. Mylander

Tags

Communities of Interest

  • Air Platforms
  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Algebra
  • Algorithms
  • Applied Mathematics
  • Arithmetic
  • Convex Sets
  • Equations
  • Evolutionary Algorithms
  • Linear Algebra
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Nonlinear Programming
  • Operations Research
  • Quadratic Programming
  • Simplex Method
  • Theorems

Fields of Study

  • Engineering

Readers

  • Operations Research