Approximation methods for problems of nonlinear programming
From MaRDI portal
Recommendations
Cited in
(20)- Algorithm for solving NLP problems with the use of a modified Lagrange function
- A note on solution of nonlinear programming problems with imprecise function and gradient values
- scientific article; zbMATH DE number 5735028 (Why is no real title available?)
- scientific article; zbMATH DE number 1292040 (Why is no real title available?)
- scientific article; zbMATH DE number 4174688 (Why is no real title available?)
- scientific article; zbMATH DE number 4188424 (Why is no real title available?)
- scientific article; zbMATH DE number 67668 (Why is no real title available?)
- Partial linearization methods in nonlinear programming
- The Lagrange multiplier method in the finite convex programming problem
- An approximate algorithm for nonlinear integer programming
- Second order convexity and a modified objective function method in mathematical programming
- The complexity of approximating a nonlinear program
- Modified Lagrangian and least root approaches for general nonlinear optimization problems
- scientific article; zbMATH DE number 3904349 (Why is no real title available?)
- An Analysis of Approximate Nonlinear Elimination
- Approximation to nonproper problems of convex programming
- An approximate algorithm for nonlinear integer programming
- scientific article; zbMATH DE number 69319 (Why is no real title available?)
- The Lagrange method and SAO with bounds on the dual variables
- Ein überlinear konvergentes verfahren mit modifizierten Lagrangefunktionen
This page was built for publication: Approximation methods for problems of nonlinear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1903934)