A projective method for structured nonlinear programs

DOI10.1007/BF01584096zbMath0254.90048OpenAlexW2069589250MaRDI QIDQ5668258

Michael D. Grigoriadis

Publication date: 1971

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01584096

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items

An algorithm for hierarchical optimization of large-scale problems with nested structure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Primal partition programming for block diagonal matrices
• A decomposition method for structured quadratic programming problems
• Generalized upper bounding techniques
• A decomposition method for structured linear and nonlinear programs
• Decomposition Principle for Linear Programs
• The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
• `` Direct Search Solution of Numerical and Statistical Problems
• Equivalence in nonlinear programming
• Minimizing Certain Convex Functions
• Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
• Elements of Large-Scale Mathematical Programming Part I: Concepts
• A Dual Generalized Upper Bounding Technique
• The Pseudoinverse of a Rectangular or Singular Matrix and Its Application to the Solution of Systems of Linear Equations
• Upper Bounds, Secondary Constraints, and Block Triangularity in Linear Programming