The Lagrange multiplier method in the finite convex programming problem

zbMATH Open1338.65167MaRDI QIDQ2802632FDOQ2802632

Authors: A. Zhiltsov, R. V. Namm 

Publication date: 26 April 2016

Published in: Dal'nevostochnyĭ Matematicheskiĭ Zhurnal (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/dvmg298

Recommendations

• Convex programming algorithm with a modified Lagrange function
• Approximation methods for problems of nonlinear programming
• scientific article; zbMATH DE number 4112389
• scientific article; zbMATH DE number 3892945
• scientific article; zbMATH DE number 6701

zbMATH Keywords

convex optimizationLagrange multiplier methodfinite convex programming

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Duality theory (optimization) (49N15)

Cited In (16)

• Approximation methods for problems of nonlinear programming
• Title not available (Why is that?)
• Title not available (Why is that?)
• Thermodynamic consistency and mathematical well-posedness in the theory of elastoplastic, granular, and porous materials
• Title not available (Why is that?)
• Title not available (Why is that?)
• Lagrangian approach to quasiconvex programing
• Partially finite convex programming. II: Explicit lattice models
• Title not available (Why is that?)
• A hypoquadratic convergence method for Lagrange multipliers
• Title not available (Why is that?)
• The stable Lagrange principle in sequential form for the convex programming problem in a uniformly convex space and its applications
• On the connection between the stabilized Lagrange multiplier and Nitsche's methods
• Title not available (Why is that?)
• Some new properties of the Lagrange function and its applications
• Title not available (Why is that?)

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)