Global optimality conditions for nonconvex optimization
From MaRDI portal
Publication:1265197
DOI10.1023/A:1008277314050zbMATH Open0908.90243MaRDI QIDQ1265197FDOQ1265197
Authors: A. S. Strekalovskiĭ 
Publication date: 27 September 1998
Published in: Journal of Global Optimization (Search for Journal in Brave)
Recommendations
normal conesubdifferentialextreme pointsglobal optimality conditionsLebesgue set of a convex function
Cited In (49)
- Global optimality conditions for nonconvex minimization problems with quadratic constraints
- On local search in d.c. optimization problems
- A successive linear approximation algorithm for the global minimization of a concave quadratic program
- Aggregate subgradient method for nonsmooth DC optimization
- Duality and optimality conditions for reverse convex programs via a convex decomposition
- Dual formulation of the sparsity constrained optimization problem: application to classification
- A Global Optimization Approach to Nonzero Sum Six-Person Game
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions
- Essentials of numerical nonsmooth optimization
- A computational method for solving \(n\)-person game
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- The directional subdifferential of the difference of two convex functions
- Global optimization of nonconvex problems with multilinear intermediates
- Optimality conditions in global optimization and their applications
- Necessary and sufficient global optimality conditions for convex maximization revisited
- Global optimality conditions for quadratic \(0-1\) optimization problems
- Difference of Convex programming in adversarial SVM
- On the subdifferentiability of the difference of two functions and local minimization
- Global optimization of nonconvex factorable programming problems
- Title not available (Why is that?)
- Piece adding technique for convex maximization problems
- Reverse convex problems: an approach based on optimality conditions
- Equity models in planar location
- Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization
- CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS
- Global optimality conditions for cubic minimization problem with box or binary constraints
- Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints
- New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming
- Optimality conditions of first order for global minima of locally Lipschitz functions
- Optimization and Optimal Control Approach to Japanese Sangaku Six Equal Circles Problem
- Global rates of convergence for nonconvex optimization on manifolds
- Feature selection in SVM via polyhedral \(k\)-norm
- On global unconstrained minimization of the difference of polyhedral functions
- A local search method for optimization problem with d.c. inequality constraints
- Global optimality conditions and exact penalization
- A novel approach for nonconvex optimal control problems
- Global optimality conditions in nonconvex optimization
- Optimality conditions and algorithms for integral global minimization
- New global optimality conditions for nonsmooth DC optimization problems
- Global sufficient optimality conditions for a special cubic minimization problem
- Closedness conditions for the optimality of a family of non-convex optimization problems
- Optimality conditions for the minimization of quadratic \(0-1\) problems
- Global minimization algorithms for concave quadratic programming problems
- A global optimization algorithm for solving a four-person game
- The globalized modification of Rosenbrock algorithm for finding anti-Nash equilibrium in bimatrix game
- A method for semidefinite quasiconvex maximization problem
- Inscribed ball and enclosing box methods for the convex maximization problem
- Essentials of numerical nonsmooth optimization
- Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines
This page was built for publication: Global optimality conditions for nonconvex optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1265197)
