Accession Number:

ADA008362

Title:

A New Class of Feasible Direction Methods.

Descriptive Note:

Research rept.,

Corporate Author:

TEXAS UNIV AT AUSTIN CENTER FOR CYBERNETIC STUDIES

Personal Author(s):

• Ben-Tal,A.
• Zlobec,S.

Report Date:

1975-02-01

Pagination or Media Count:

31.0

Abstract:

This paper introduces a new class of feasible direction methods for solving convex programming problems with differentiable functions. Unlike most currently used feasible direction methods, the ones presented here are not based on the Kuhn-Tucker theory. One of the methods is designed to solve convex problems without assuming Slaters condition or any other constraint qualification. The other method assumes Slaters condition but it provides at each step a feasible direction of steepest descent which is generally better than the one obtained by the classical Zoutendijk method and its variants.

Descriptors:

• *MATHEMATICAL PROGRAMMING
• *CONVEX SETS
• LINEAR PROGRAMMING
• THEOREMS

Subject Categories:

• Operations Research

Distribution Statement:

APPROVED FOR PUBLIC RELEASE