Pages that link to "Item:Q1265197"
From MaRDI portal
The following pages link to Global optimality conditions for nonconvex optimization (Q1265197):
Displaying 48 items.
- Global optimality conditions for nonconvex minimization problems with quadratic constraints (Q265137) (← links)
- On local search in d.c. optimization problems (Q299416) (← links)
- On global unconstrained minimization of the difference of polyhedral functions (Q540713) (← links)
- Piece adding technique for convex maximization problems (Q604949) (← links)
- The directional subdifferential of the difference of two convex functions (Q628751) (← links)
- A successive linear approximation algorithm for the global minimization of a concave quadratic program (Q827382) (← links)
- Reverse convex problems: an approach based on optimality conditions (Q868408) (← links)
- Equity models in planar location (Q871686) (← links)
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions (Q985310) (← links)
- On the subdifferentiability of the difference of two functions and local minimization (Q1005123) (← links)
- Optimality conditions in global optimization and their applications (Q1016343) (← links)
- Necessary and sufficient global optimality conditions for convex maximization revisited (Q1378644) (← links)
- Global optimality condition and fixed point continuation algorithm for non-Lipschitz \(\ell_p\) regularized matrix minimization (Q1650690) (← links)
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations (Q1754446) (← links)
- Global sufficient optimality conditions for a special cubic minimization problem (Q1955308) (← links)
- Global optimality conditions for cubic minimization problem with box or binary constraints (Q1959231) (← links)
- Aggregate subgradient method for nonsmooth DC optimization (Q1996741) (← links)
- New LP-based local and global algorithms for continuous and mixed-integer nonconvex quadratic programming (Q2124794) (← links)
- DC semidefinite programming and cone constrained DC optimization. I: Theory (Q2149953) (← links)
- Global optimality conditions for quadratic \(0-1\) optimization problems (Q2269587) (← links)
- A local search method for optimization problem with d.c. inequality constraints (Q2295325) (← links)
- Feature selection in SVM via polyhedral \(k\)-norm (Q2300635) (← links)
- New global optimality conditions for nonsmooth DC optimization problems (Q2301178) (← links)
- Global optimization of nonconvex problems with multilinear intermediates (Q2356333) (← links)
- A computational method for solving \(n\)-person game (Q2405332) (← links)
- Global optimality conditions in nonconvex optimization (Q2412831) (← links)
- A global optimization algorithm for solving a four-person game (Q2421448) (← links)
- Global optimality conditions and exact penalization (Q2421449) (← links)
- Optimality conditions and algorithms for integral global minimization (Q2426006) (← links)
- Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints (Q2471081) (← links)
- A method for semidefinite quasiconvex maximization problem (Q2627190) (← links)
- Optimality Conditions for the Minimization of Quadratic 0-1 Problems (Q2945127) (← links)
- Optimality conditions of first order for global minima of locally Lipschitz functions (Q2996802) (← links)
- CONDITIONS FOR GLOBAL OPTIMALITY OF QUADRATIC MINIMIZATION PROBLEMS WITH LMI CONSTRAINTS (Q3439884) (← links)
- (Q3462923) (← links)
- Global minimization algorithms for concave quadratic programming problems (Q3534648) (← links)
- A novel approach for nonconvex optimal control problems (Q3646087) (← links)
- Global rates of convergence for nonconvex optimization on manifolds (Q5113326) (← links)
- A Global Optimization Approach to Nonzero Sum Six-Person Game (Q5118431) (← links)
- Essentials of numerical nonsmooth optimization (Q5918756) (← links)
- Global optimization of nonconvex factorable programming problems (Q5930738) (← links)
- Inscribed ball and enclosing box methods for the convex maximization problem (Q5963240) (← links)
- Essentials of numerical nonsmooth optimization (Q5970841) (← links)
- Sparse optimization via vector \(k\)-norm and DC programming with an application to feature selection for support vector machines (Q6051312) (← links)
- Duality and optimality conditions for reverse convex programs via a convex decomposition (Q6183466) (← links)
- Optimization and Optimal Control Approach to Japanese Sangaku Six Equal Circles Problem (Q6490264) (← links)
- Dual formulation of the sparsity constrained optimization problem: application to classification (Q6585821) (← links)
- Difference of Convex programming in adversarial SVM (Q6593354) (← links)