Monotone Operators in Mathematical Programming.

Abstract

An algorithm was investigated for solving problems where the object is to find x epsilon A and y epsilon A with y epsilon T(x), where T is a maximal monotone multifunction. An algorithm was described for finding a feasible point for a system of linear inequalities. For inconsistent systems, the feasible point algorithm was shown to generate a sequence converging at a linear rate to the set of least-square solutions. A primal-dual decomposition method was investigated to solve the separable convex programming problem. (Author)

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1984
Accession Number
ADA147309

Entities

People

  • J. E. Spingarn

Organizations

  • Georgia Tech

Tags

Communities of Interest

  • Air Platforms
  • Energy and Power Technologies

DTIC Thesaurus Topics

  • Air Force
  • Air Force Facilities
  • Algorithms
  • Applied Mathematics
  • Computer Programming
  • Convergence
  • Convex Programming
  • Convex Sets
  • Inequalities
  • Linear Programming
  • Mathematical Programming
  • Mathematics
  • Numbers
  • Optimization
  • Scientific Research
  • Sequences
  • Theorems

Fields of Study

  • Mathematics

Readers

  • Operations Research