A method for semidefinite quasiconvex maximization problem

zbMath1364.90270MaRDI QIDQ2627190

Khalide Jbilou, Tamjav Bayartugs, Rentsen Enkhbat, Mohammed Bellalij

Publication date: 30 May 2017

Published in: Izvestiya Irkutskogo Gosudarstvennogo Universiteta. Seriya Matematika (Search for Journal in Brave)

Full work available at URL: http://isu.ru/journal/downloadArticle?article=_e64ad542c8054124bf7d0ed002654df6&lang=eng

zbMATH Keywords

algorithmglobal optimality conditionsapproximation setsemidefinite linear programmingsemidefinite quasiconvex maximization

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Nonsmooth analysis (49J52)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Quasiconvex semidefinite minimization problem
• Global optimality conditions for nonconvex optimization
• Topics in semidefinite and interior-point methods
• On Extending Some Primal--Dual Interior-Point Algorithms From Linear Programming to Semidefinite Programming
• Semidefinite Programming
• Regularization Methods for Semidefinite Programming
• Handbook of semidefinite programming. Theory, algorithms, and applications

This page was built for publication: A method for semidefinite quasiconvex maximization problem