On reducibility of the general convex programming problem to an unconditional extremum problem

zbMATH Open0885.90099MaRDI QIDQ1380189FDOQ1380189

Authors: E. G. Belousov, V. G. Andronov 

Publication date: 9 March 1998

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

Recommendations

• On the weak convergence of the method of penalty functions with respect to argument
• Functional convergence theorems for the penalty function method
• On the convergence of the penalty function method with respect to a functional
• An approach to constructing generalized penalty functions.

zbMATH Keywords

penalty functionssequence of unconditional extremum problems

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Cited In (5)

• The method of solving the convex two-level programming by penalty function
• Title not available (Why is that?)
• An approach to constructing generalized penalty functions.
• An approach to the solution of nonlinear unconstrained optimization problems
• Analysis of penalty parameters in binary constrained extremum problems

This page was built for publication: On reducibility of the general convex programming problem to an unconditional extremum problem

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