Two modifications of the linearization method in non-linear programming
From MaRDI portal
Publication:3340517
Recommendations
- Partial linearization methods in nonlinear programming
- Linearization method using modified Lagrange functions
- scientific article; zbMATH DE number 1445590
- scientific article; zbMATH DE number 1524343
- Two schemes for a non-linear method of optimization in extremal problems
- scientific article; zbMATH DE number 5663234
- A non-modulus linear method for solving the linear complementarity problem
- A modified two-step method for solving interval linear programming problems
- A modified Lagrange function for the linear programming problems
- scientific article; zbMATH DE number 1191015
Cited in
(5)- Iterative algorithm for minimizing a convex function at the intersection of a spherical surface and a convex compact set
- Linearization method using modified Lagrange functions
- Modification of the recursive solution procedure for a linear programming problem
- Convergence of the gradient projection method and Newton's method as applied to optimization problems constrained by intersection of a spherical surface and a convex closed set
- An extension of the gradient projection method and Newton's method to extremum problems constrained by a smooth surface
This page was built for publication: Two modifications of the linearization method in non-linear programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3340517)
