On the penalization method in mathematical programming

zbMATH Open0886.90131MaRDI QIDQ1375017FDOQ1375017

Authors: Ivan I. Eremin 

Publication date: 5 January 1998

Published in: Doklady Mathematics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 3956824
• On reducibility of the general convex programming problem to an unconditional extremum problem
• Asymptotic equivalence of two finite penalty methods of first order
• scientific article; zbMATH DE number 4093199
• scientific article; zbMATH DE number 4031412

zbMATH Keywords

penalization methodnondifferentiabilitypiecewise linear programmingequivalence theoremsestimates of the constraint residualssequential correction of an improver linear programmingsequential Pareto correction

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cited In (5)

• On the construction of regularizing algorithms for the correction of improper convex programming problems
• Author's results on mathematical programming in retrospect
• On the application of the residual method for the correction of inconsistent problems of convex programming
• Title not available (Why is that?)
• Asymptotic equivalence of two finite penalty methods of first order

This page was built for publication: On the penalization method in mathematical programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1375017)