Complexity Issues in Numerical Optimization

Abstract

A conference on complexity issues in numerical optimization was held in Ithaca, NY on March 22-23, 1991. The conference featured 17 invited speakers, each of whom gave a 45 minute presentation. The conference was supported primarily by the Air Force Office of Scientific Research, with additional support from the Cornell Mathematical Sciences Institute and SIAM. Topics discussed included: Strongly polynomial algorithms for linear programs with algebraic coefficients; New results for the Steiner tree problem, Complexity results for following the center of a linear inequality system as the data is parametrically deformed; Continuous methods for inductive inference problems, Computational complexity of inner and outer j-radii; Parallel complexity of linear programming, and New iterative methods for linear inequalities.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Sep 17, 1991
Accession Number
ADA241854

Entities

People

  • Steven A. Vavasis

Organizations

  • Cornell University

Tags

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Classification
  • Computational Complexity
  • Computer Programming
  • Computer Science
  • Evolutionary Algorithms
  • Inequalities
  • Linear Programming
  • Mathematical Programming
  • Optimization
  • Scientific Research
  • Security

Readers

  • Academic Conference Management
  • Graph Algorithms and Convex Optimization.
  • Operations Research

Technology Areas

  • AI & ML
  • AI & ML - Machine Learning Algorithms