The linearization method
From MaRDI portal
Recommendations
Cites work
- A globally convergent method for nonlinear programming
- A quadratically-convergent algorithm for general nonlinear programming problems
- Algorithms for nonlinear constraints that use lagrangian functions
- Dual Variable Metric Algorithms for Constrained Optimization
- On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function
- Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms
- Superlinearly convergent quasi-newton algorithms for nonlinearly constrained optimization problems
- Superlinearly convergent variable metric algorithms for general nonlinear programming problems
Cited in
(30)- The linearization method: Principal concepts and perspective directions
- Linearization method using modified Lagrange functions
- The multiproximal linearization method for convex composite problems
- Technology of multilinear programming in naturally conditioned models. I
- Technology of multilinear programming in naturally conditioned models. II
- A linearization method for nondegenerate variational conditions
- Vertex-searching method for linear interaction programming
- scientific article; zbMATH DE number 3846334 (Why is no real title available?)
- Method of linearization without analytic evaluation of derivatives
- scientific article; zbMATH DE number 3854821 (Why is no real title available?)
- scientific article; zbMATH DE number 3878244 (Why is no real title available?)
- scientific article; zbMATH DE number 4137527 (Why is no real title available?)
- A modification of the method of linearization for solving a mathematical programming problem on a simple set of ``parallelepiped type
- scientific article; zbMATH DE number 3918114 (Why is no real title available?)
- scientific article; zbMATH DE number 3922390 (Why is no real title available?)
- scientific article; zbMATH DE number 3930255 (Why is no real title available?)
- scientific article; zbMATH DE number 3941276 (Why is no real title available?)
- scientific article; zbMATH DE number 3977440 (Why is no real title available?)
- scientific article; zbMATH DE number 3991284 (Why is no real title available?)
- scientific article; zbMATH DE number 4068633 (Why is no real title available?)
- scientific article; zbMATH DE number 4076981 (Why is no real title available?)
- Using Lin's method to solve Bykov's problems
- scientific article; zbMATH DE number 1300235 (Why is no real title available?)
- scientific article; zbMATH DE number 1524343 (Why is no real title available?)
- scientific article; zbMATH DE number 3995465 (Why is no real title available?)
- scientific article; zbMATH DE number 937826 (Why is no real title available?)
- Application of the linearization method to problems of large dimension
- A representation of generalized convex polyhedra and applications
- scientific article; zbMATH DE number 5233656 (Why is no real title available?)
- Nonlinear programming problem with variable coefficients and a linearization method
This page was built for publication: The linearization method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4729625)