Global optimality conditions for nonconvex optimization
From MaRDI portal
Publication:1265197
DOI10.1023/A:1008277314050zbMath0908.90243MaRDI QIDQ1265197
Publication date: 27 September 1998
Published in: Journal of Global Optimization (Search for Journal in Brave)
normal coneextreme pointssubdifferentialglobal optimality conditionsLebesgue set of a convex function
Related Items
Global optimality conditions for nonconvex minimization problems with quadratic constraints ⋮ New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming ⋮ A successive linear approximation algorithm for the global minimization of a concave quadratic program ⋮ A method for semidefinite quasiconvex maximization problem ⋮ On local search in d.c. optimization problems ⋮ DC semidefinite programming and cone constrained DC optimization. I: Theory ⋮ Reverse convex problems: an approach based on optimality conditions ⋮ Equity models in planar location ⋮ A computational method for solving \(n\)-person game ⋮ Piece adding technique for convex maximization problems ⋮ Optimality Conditions for the Minimization of Quadratic 0-1 Problems ⋮ Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines ⋮ A global optimization algorithm for solving a four-person game ⋮ The globalized modification of Rosenbrock algorithm for finding anti-Nash equilibrium in bimatrix game ⋮ The directional subdifferential of the difference of two convex functions ⋮ Duality and optimality conditions for reverse convex programs via a convex decomposition ⋮ A Global Optimization Approach to Nonzero Sum Six-Person Game ⋮ Global sufficient optimality conditions for a special cubic minimization problem ⋮ Global optimality conditions for cubic minimization problem with box or binary constraints ⋮ Global minimization algorithms for concave quadratic programming problems ⋮ Optimality conditions of first order for global minima of locally Lipschitz functions ⋮ Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints ⋮ Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations ⋮ Aggregate subgradient method for nonsmooth DC optimization ⋮ On global unconstrained minimization of the difference of polyhedral functions ⋮ Global optimality conditions for quadratic \(0-1\) optimization problems ⋮ Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions ⋮ Inscribed ball and enclosing box methods for the convex maximization problem ⋮ On the subdifferentiability of the difference of two functions and local minimization ⋮ A local search method for optimization problem with d.c. inequality constraints ⋮ Essentials of numerical nonsmooth optimization ⋮ Feature selection in SVM via polyhedral \(k\)-norm ⋮ New global optimality conditions for nonsmooth DC optimization problems ⋮ Optimality conditions in global optimization and their applications ⋮ A novel approach for nonconvex optimal control problems ⋮ Essentials of numerical nonsmooth optimization ⋮ CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS
