A Dual Differentiable Exact Penalty Function.

Abstract

A new penalty function is associated with an inequality constrained nonlinear programming problem via its dual. This penalty function is globally differentiable if the functions defining the original problem are twice globally differentiable. In addition, the penalty parameter remains finite. This approach reduces the original problem to a simple problem of maximizing a globally differentiable function on the product space of a Euclidean space and the nonnegative orthant of another Euclidean space. Many efficient algorithms exist for solving this problem. For the case of quadratic programming, the penalty function problem can be solved effectively by successive overrelaxation (SOR) methods which can handle huge problems while preserving sparsity features. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1981
Accession Number
ADA103859

Entities

People

  • Olvi L. Mangasarian
  • S. -p. Han

Organizations

  • University of Wisconsin–Madison

Tags

DTIC Thesaurus Topics

  • Algorithms
  • Applied Mathematics
  • Computer Programming
  • Evolutionary Algorithms
  • Inequalities
  • Linear Programming
  • Mathematical Analysis
  • Mathematical Programming
  • Mathematics
  • Nonlinear Programming
  • Numerical Analysis
  • Operations Research
  • Optimization
  • Quadratic Programming
  • Theorems
  • United States

Fields of Study

  • Mathematics

Readers

  • Linear Algebra
  • Systems Analysis and Design

Technology Areas

  • Space