A Polynomial Primal-Dual Interior Point Method for Convex Programming with Quadratic Constraints

Abstract

This dissertation involves the solution of a convex nonlinear programming problem using a primal-dual algorithm developed in McCormick(1991a and 1991b)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Apr 01, 1993
Accession Number
ADA267495

Entities

People

  • Lee J. Lehmkuhl

Organizations

  • Air Force Institute of Technology

Tags

Communities of Interest

  • Counter WMD
  • Weapons Technologies

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Computational Complexity
  • Computational Fluid Dynamics
  • Computational Science
  • Convex Programming
  • Equations
  • Linear Programming
  • Mathematical Programming
  • New York
  • Nonlinear Programming
  • Numerical Analysis
  • Operations Research
  • Optimization
  • Quadratic Programming
  • Simplex Method
  • Standards

Fields of Study

  • Mathematics