Lagrange multiplier conditions characterizing the optimal solution sets of cone-constrained convex programs
https://doi.org/10.1023/B:JOTA.0000043992.38554.c8Publisher, magazine: ,
Publication year: 2004
Lưu Trích dẫn Chia sẻAbstract
First, the authors establish that the Lagrangian function of (P) is constant on the solution set of (P). Then, they present various simple Lagrange multiplier-based characterizations of the solution set of (P). It is shown that, for a finite-dimensional convex program with inequality constraints, the characterizations illustrate the property that the active constraints with positive Lagrange multipliers at an optimal solution remain active at all optimal solutions of (P). Finally, they present applications of these results to derive corresponding Lagrange multiplier characterizations of the solution sets of semidefinite programs and fractional programs. In particular, they characterize the solution set of a semidefinite linear program in terms of a complementary slackness condition with a fixed Lagrange multiplier. Specific examples are given to illustrate the significance of the results.
Tags: solution sets; abstract convex programs; semidefinite programs; Lagrange multipliers; fractional programs
Các bài viết liên quan đến tác giả Jeya Jeyakumar
Global minimization of difference of quadratic and convex functions over box or binary constraints
Convex composite non-Lipschitz programming
Sharp variational conditions for convex composite nonsmooth functions
An open mapping theorem using unbounded generalized Jacobians
Sequential Lagrangian conditions for convex programs with applications to semidefinite programming
Nonsmooth calculus, minimality, and monotonicity of convexificators
Global optimality of quadratic minimization over symmetric polytopes