The Continuous Linearization Method of the Fourth Order
The convex analysis of unitarily invariant matrix functions.
The duality theory for general convex quadratic programs
The Farkas lemma of Glover
The steepest-ascent method for the linear programming problem
The trust region affine interior point algorithm for convex and nonconvex quadratic programming
The weighted Fermat triangle problem.
Transportation Technique for a Particular Convex Programming Problem
Two characterizations of Pareto minima in convex multicriteria optimization
Two conditions are given each of which is both necessary and sufficient for a point to be a global Pareto minimum. The first one is obtained by studying programs where each criterion appears as a single objective function, while the second one is given in terms of a "restricted Lagrangian". The conditions are compared with the familiar characterizations of properly efficient and weakly efficient points of Karlin and Geoffrion.