Potential Reduction Interior Point Methods for Mixed Nonlinear Complementarity Problems, Nonlinear Programs, and Extensions.

Abstract

The main goal of this project was to study interior-point algorithms for solving the nonlinear complementarity problem (NCP) and its extensions such as the mixed NCP and the constrained nonlinear equation problem, and to obtain more specialized convergence results for the particular case of the mixed NCP which arises from the Karush-Kuhn-Tucker (KKT) conditions of general nonlinear programming problems.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Dec 31, 1996
Accession Number
ADA322961

Entities

People

  • Renato D. Monteiro

Organizations

  • Georgia Tech

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Computer Programming
  • Contract Administration
  • Convergence
  • Convex Programming
  • Equations
  • Evolutionary Algorithms
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Military Research
  • Nonlinear Programming
  • Operations Research
  • Optimization
  • Quadratic Programming
  • Semidefinite Programming
  • Systems Engineering

Fields of Study

  • Mathematics

Readers

  • Operations Research