Pages that link to "Item:Q1903934"
From MaRDI portal
The following pages link to Approximation methods for problems of nonlinear programming (Q1903934):
Displaying 16 items.
- Approximation to nonproper problems of convex programming (Q799481) (← links)
- Partial linearization methods in nonlinear programming (Q1321373) (← links)
- Adduced direction method based on modified Lagrange function for problem of nonlinear programming (Q1380194) (← links)
- Modified Lagrangian and least root approaches for general nonlinear optimization problems (Q1611091) (← links)
- The complexity of approximating a nonlinear program (Q1906280) (← links)
- The Lagrange multiplier method in the finite convex programming problem (Q2802632) (← links)
- (Q3574539) (← links)
- A note on solution of nonlinear programming problems with imprecise function and gradient values (Q3775341) (← links)
- (Q4013592) (← links)
- (Q4014788) (← links)
- (Q4241608) (← links)
- An Analysis of Approximate Nonlinear Elimination (Q4874541) (← links)
- The Lagrange method and SAO with bounds on the dual variables (Q5746694) (← links)
- (Q5752990) (← links)
- An approximate algorithm for nonlinear integer programming (Q5906393) (← links)
- An approximate algorithm for nonlinear integer programming (Q5906559) (← links)