On convex optimization without convex representation

Jean B. Lasserre

Type: Article

Publication Date: 2011-04-12

Citations: 19

DOI: https://doi.org/10.1007/s11590-011-0323-1

Similar Works

Action	Title	Year	Authors
+ PDF Chat	Erratum to: On convex optimization without convex representation	2014	Jean B. Lasserre
+	On the classical logarithmic barrier function method for a class of smooth convex programming problems	1992	Dick den Hertog C. Roos Tamás Terlaky
+	On controlling the parameter in the logarithmic barrier term for convex programming problems	1995	K. O. Kortanek Jianxiong Zhu
+	Convex optimization	2021	Evgeniya Vorontsova Roland Hildebrand Alexander Gasnikov Fedor Stonyakin
+	Convex optimization	2021	Evgeniya Vorontsova Roland Hildebrand Alexander Gasnikov Fedor Stonyakin
+	Convex optimization	2021	Evgeniya Vorontsova Roland Hildebrand Alexander Gasnikov Fedor Stonyakin
+	Convex Optimization	2008
+	Convex Optimization	2021	Mikhail Moklyachuk
+	Convex optimization	2010	Florian Jarre Stephen A. Vavasis
+	Convex Optimization	2006
+	Convex Optimization	2011
+	Convex Optimization	1998	Stephen A. Vavasis
+	Convex optimization	2016
+	Convex Optimization	2005	Hans-Jakob Luethi
+	Convex Optimization	2013	Yurii Nesterov
+	Convex Optimization	2023	Jeffrey Paul Wheeler
+	Convex Optimization	2004
+ PDF Chat	Convex optimization	2021	Evgeniya Vorontsova Roland Hildebrand Alexander Gasnikov Fedor Stonyakin
+	Convex optimization	2013
+	Convex Optimization	2010

Action	Title	Year	Authors
+	Karush-Kuhn-Tucker Optimality Conditions and Duality for Multiobjective Semi-Infinite Programming Via Tangential Subdifferentials	2019	Lê Thanh Tùng
+ PDF Chat	Optimality conditions for nonconvex problems over nearly convex feasible sets	2021	Nagh Ghafari H. Mohebi
+	Barrier method in nonsmooth convex optimization without convex representation	2014	Joydeep Dutta
+ PDF Chat	Convex inner approximations of nonconvex semialgebraic sets applied to fixed-order controller design	2012	Didier Henrion Christophe Louembet
+ PDF Chat	Strong Karush–Kuhn–Tucker optimality conditions for multiobjective semi-infinite programming <i>via</i> tangential subdifferential	2018	Lê Thanh Tùng
+	Necessary and sufficient KKT optimality conditions in non-convex optimization	2016	Quyen Ho
+	Optimality conditions and a barrier method in optimization with convex geometric constraint	2018	Marius Durea Radu Strugariu
+	Sufficiency Condition for KKT Points in Non-smooth Analysis	2014	S. R. Pattanaik
+	On the Relation between the Extended Supporting Hyperplane Algorithm and Kelley's Cutting Plane Algorithm	2019	Felipe Serrano Robert Schwarz Ambros Gleixner
+ PDF Chat	On the relation between the extended supporting hyperplane algorithm and Kelley’s cutting plane algorithm	2020	Felipe Serrano Robert Schwarz Ambros Gleixner

Action	Title	Year	Authors
+	Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity	1994	Dick den Hertog
+	Lectures on Modern Convex Optimization	2001	Aharon Ben‐Tal Arkadi Nemirovski
+	Convex Bodies: The Brunn–Minkowski Theory	1993	Rolf Schneider
+	Convex Analysis and Optimization	2003	Dimitri P. Bertsekas Angelia Nedić Asuman Ozdaglar
+	Interior-Point Polynomial Algorithms in Convex Programming	1994	Yurii Nesterov Arkadi Nemirovski
+	The Sequential Unconstrained Minimization Technique for Nonlinear Programing, a Primal-Dual Method	1964	Anthony V. Fiacco Garth P. McCormick
+ PDF Chat	A geometrical insight on pseudoconvexity and pseudomonotonicity	2009	Jean-Pierre Crouzeix Andrew Eberhard Daniel Ralph
+	Characterization of the barrier parameter of homogeneous convex cones	1998	Osman Güler Levent Tunçel
+	Convexity and Optimization in Rn	2001	Leonard D. Berkovitz
+	Barrier Functions in Interior Point Methods	1996	Osman Güler