Linearization method for inverse convex programming

DOI10.1007/BF02366622MaRDI QIDQ1816013zbMATH OpenFDO

Authors L. A. Sobolenko, B. N. Pshenichnyĭ

Publication date 21 November 1996

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

zbMATH Keywords

spatial problemsconverse convex programming

Mathematics Subject Classification ID

Convex programming (90C25)

Cites work

• Sufficient conditions for extremum, penalty functions and regularity

Cited in

(7)

• Optimization of 3D objects layout into a multiply connected domain with account for shortest distances
• A generalization of the Karush-Kuhn-Tucker theorem for approximate solutions of mathematical programming problems based on quadratic approximation
• Fast-convergence algorithms for linear time-optimal control
• On the global minimum in a balanced circular packing problem
• Inverse convex programming and parallelepiped packing
• Linear programming and the inverse method of images
• scientific article; zbMATH DE number 519995 (Why is no real title available?)

This page was built for publication: Linearization method for inverse convex programming

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