The Lagrange multiplier method in the finite convex programming problem
From MaRDI portal
Recommendations
Cited in
(21)- Partially finite convex programming. II: Explicit lattice models
- A modified Lagrange function for the linear programming problems
- Mixed method for solving the general convex programming problem
- A hypoquadratic convergence method for Lagrange multipliers
- Lagrangian approach to quasiconvex programing
- Approximation methods for problems of nonlinear programming
- Thermodynamic consistency and mathematical well-posedness in the theory of elastoplastic, granular, and porous materials
- The stable Lagrange principle in sequential form for the convex programming problem in a uniformly convex space and its applications
- scientific article; zbMATH DE number 5623945 (Why is no real title available?)
- scientific article; zbMATH DE number 4066628 (Why is no real title available?)
- scientific article; zbMATH DE number 4112389 (Why is no real title available?)
- Some new properties of the Lagrange function and its applications
- scientific article; zbMATH DE number 124656 (Why is no real title available?)
- scientific article; zbMATH DE number 1070674 (Why is no real title available?)
- Modified dual scheme for finite-dimensional and infinite-dimensional convex optimization problems
- Duality theorem of convex semi-infinite programming of modified augmented Lagrange function
- scientific article; zbMATH DE number 2092220 (Why is no real title available?)
- On the connection between the stabilized Lagrange multiplier and Nitsche's methods
- On Lagrange multipliers in convex entropy minimization
- scientific article; zbMATH DE number 3892945 (Why is no real title available?)
- scientific article; zbMATH DE number 6027005 (Why is no real title available?)
This page was built for publication: The Lagrange multiplier method in the finite convex programming problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2802632)