A projective method for structured nonlinear programs
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3159112 (Why is no real title available?)
- scientific article; zbMATH DE number 3177183 (Why is no real title available?)
- scientific article; zbMATH DE number 3220839 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- scientific article; zbMATH DE number 3067835 (Why is no real title available?)
- scientific article; zbMATH DE number 3111121 (Why is no real title available?)
- A Dual Generalized Upper Bounding Technique
- A decomposition method for structured linear and nonlinear programs
- A decomposition method for structured quadratic programming problems
- Decomposition Principle for Linear Programs
- Elements of Large-Scale Mathematical Programming Part I: Concepts
- Equivalence in nonlinear programming
- Extension of Davidon’s Variable Metric Method to Maximization Under Linear Inequality and Equality Constraints
- Generalized upper bounding techniques
- Minimizing Certain Convex Functions
- Primal partition programming for block diagonal matrices
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints
- 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
- `` Direct Search Solution of Numerical and Statistical Problems
Cited in
(1)
This page was built for publication: A projective method for structured nonlinear programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5668258)
