Mixed method for solving the general convex programming problem

DOI10.1007/BF02667002zbMath0953.90047MaRDI QIDQ1288666

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

Publication date: 10 October 1999

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

zbMATH Keywords

linearizationconvex programmingcutting planeexact penalty

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (3)

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 ⋮ Developing B. N. Pshenichnyi's scientific ideas in optimization and mathematical control theory

Cites Work

• Proximity control in bundle methods for convex nondifferentiable minimization
• Modified cutting plane method for minimization of a convex function
• New variants of bundle methods
• The Cutting-Plane Method for Solving Convex Programs
• Semi-Definite Matrix Constraints in Optimization
• Convergence of the method of Chebyshev centers and some applications
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

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