Linearization method for inverse convex programming
From MaRDI portal
Publication:1816013
DOI10.1007/BF02366622zbMath0858.90103MaRDI QIDQ1816013
L. A. Sobolenko, B. N. Pshenichnyĭ
Publication date: 21 November 1996
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Related Items (5)
On the global minimum in a balanced circular packing problem ⋮ Inverse convex programming and parallelepiped packing ⋮ Fast-convergence algorithms for linear time-optimal control ⋮ 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
Cites Work
This page was built for publication: Linearization method for inverse convex programming
