Similar Search Results

Inexact projected gradient method for vector optimization

Fukuda, Ellen; Drummond, L. Graña - In: Computational Optimization and Applications 54 (2013) 3, pp. 473-493

. For partial orders induced by both pointed and nonpointed cones, under some reasonable hypotheses, global convergence to …

Persistent link: https://www.econbiz.de/10010998275

Newton-like methods for efficient solutions in vector optimization

Chuong, Thai - In: Computational Optimization and Applications 54 (2013) 3, pp. 495-516

In this work we study the Newton-like methods for finding efficient solutions of the vector optimization problem for a map from a finite dimensional Hilbert space X to a Banach space Y, with respect to the partial order induced by a closed, convex and pointed cone C with a nonempty interior. We...

Persistent link: https://www.econbiz.de/10010998354

Strong duality and minimal representations for cone optimization

Tunçel, Levent; Wolkowicz, Henry - In: Computational Optimization and Applications 53 (2012) 2, pp. 619-648

. We take a fresh look at known and new results for duality, optimality, constraint qualifications, CQ, and strict …The elegant theoretical results for strong duality and strict complementarity for linear programming, LP, lie behind … interior-point methods. However, the theory and preprocessing techniques can fail for cone programming over nonpolyhedral cones …

Persistent link: https://www.econbiz.de/10010600749

Optimality conditions and duality for semi-infinite programming involving B-arcwise connected functions

Zhang, Qingxiang - In: Computational Optimization and Applications 45 (2009) 4, pp. 615-629

Persistent link: https://www.econbiz.de/10008467087

Space tensor conic programming

Qi, Liqun; Ye, Yinyu - In: Computational Optimization and Applications 59 (2014) 1, pp. 307-319

study the CLP formulation and the duality of positive semi-definite space tensor conic programming. Copyright Springer …

Persistent link: https://www.econbiz.de/10010937796