首页 | 本学科首页   官方微博 | 高级检索  
     检索      


Characterizations of optimality in convex programming: the nondifferentiable case
Authors:A Ben-Tal    MZ Nashed
Institution:1. University of South Florida , Tampa, Florida, 33620, U.S.A;2. University of Southern California , Los Angeles, California, 90007, U.S.A
Abstract:Primal, dual and saddle-point characterizations of optimality are given for convex programming in the general case (nondifferentiable functions and no constraint qualification).
Keywords:Nonlinear ordinary differential equations  boundary value problems  periodic solutions
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号