Mixed method for solving the general convex programming problem

DOI10.1007/BF02667002MaRDI QIDQ1288666zbMATH OpenFDO

Authors B. N. Pshenichnyĭ, É. I. Nenakhov, V. N. Kuz'menko

Publication date 10 October 1999

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02667002

zbMATH Keywords

convex programminglinearizationcutting planeexact penalty

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• scientific article; zbMATH DE number 3847229
• scientific article; zbMATH DE number 3882207
• The Lagrange multiplier method in the finite convex programming problem
• Generalized convex programming
• scientific article; zbMATH DE number 3850830

Cites work

• scientific article; zbMATH DE number 3830713 (Why is no real title available?)
• scientific article; zbMATH DE number 3846334 (Why is no real title available?)
• scientific article; zbMATH DE number 4083354 (Why is no real title available?)
• scientific article; zbMATH DE number 3750660 (Why is no real title available?)
• scientific article; zbMATH DE number 729680 (Why is no real title available?)
• scientific article; zbMATH DE number 892026 (Why is no real title available?)
• scientific article; zbMATH DE number 3397319 (Why is no real title available?)
• Convergence of the method of Chebyshev centers and some applications
• Modified cutting plane method for minimization of a convex function
• New variants of bundle methods
• Proximity control in bundle methods for convex nondifferentiable minimization
• Semi-Definite Matrix Constraints in Optimization
• The Cutting-Plane Method for Solving Convex Programs

Cited in

(10)

• On the Linear Convergence of Descent Methods for Convex Essentially Smooth Minimization
• scientific article; zbMATH DE number 3883964 (Why is no real title available?)
• Solving generalized mixed equilibria, variational inequalities, and constrained convex minimization
• Developing B. N. Pshenichnyi's scientific ideas in optimization and mathematical control theory
• Mirror-Descent Methods in Mixed-Integer Convex Optimization
• scientific article; zbMATH DE number 16430 (Why is no real title available?)
• scientific article; zbMATH DE number 3847229 (Why is no real title available?)
• Convex optimization on mixed domains
• Certain questions in solving block nonlinear optimization problems with coupling variables
• Solving optimization problems with linear-fractional objective functions and additional constraints on the arrangements

This page was built for publication: Mixed method for solving the general convex programming problem

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