Quasiconvex semidefinite minimization problem

DOI10.1155/2013/346131MaRDI QIDQ896728zbMATH OpenOpenAlexWikidataFDO

Authors R. Enkhbat, Tamjav Bayartugs

Publication date 11 December 2015

Published in Journal of Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1155/2013/346131

Mathematics Subject Classification ID

Semidefinite programming (90C22)

Review text

Summary: We introduce so-called semidefinite quasiconvex minimization problem. We derive new global optimality conditions for the above problem. Based on the global optimality conditions, we construct an algorithm which generates a sequence of local minimizers which converge to a global solution.

Recommendations

• A method for semidefinite quasiconvex maximization problem
• Semidefinite concave programming
• scientific article; zbMATH DE number 1941908
• On the maximization and minimization of a quasiconvex function
• scientific article; zbMATH DE number 5880478

Cited in

(4)

• Quadratic maximization and semidefinite relaxation
• A method for semidefinite quasiconvex maximization problem
• Semidefinite concave programming
• Quasiconvex minimization on a locally finite union of convex sets

This page was built for publication: Quasiconvex semidefinite minimization problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q896728)