On the regularization of the Lagrange principle and on the construction of the generalized minimizing sequences in convex constrained optimization problems

DOI10.35634/vm200305zbMath1479.90160OpenAlexW4242985735MaRDI QIDQ4986766

M. I. Sumin

Publication date: 28 April 2021

Published in: Vestnik Udmurtskogo Universiteta. Matematika. Mekhanika. Komp'yuternye Nauki (Search for Journal in Brave)

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

zbMATH Keywords

instabilityconstrained optimizationdual regularizationgeneralized minimizing sequenceregularized Lagrange principle

Mathematics Subject Classification ID

Ill-posedness and regularization problems in numerical linear algebra (65F22) Convex programming (90C25) Programming in abstract spaces (90C48) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10)

Related Items (1)

Lagrange principle and its regularization as a theoretical basis of stable solving optimal control and inverse problems

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stable iterative Lagrange principle in convex programming as a tool for solving unstable problems
• Regularized parametric Kuhn-Tucker theorem in a Hilbert space
• Stable sequential convex programming in a Hilbert space and its application for solving unstable problems
• Duality-based regularization in a linear convex mathematical programming problem

This page was built for publication: On the regularization of the Lagrange principle and on the construction of the generalized minimizing sequences in convex constrained optimization problems