Pages that link to "Item:Q1281477"
From MaRDI portal
The following pages link to Conditions for global optimality. II (Q1281477):
Displaying 39 items.
- Global optimality conditions for nonconvex minimization problems with quadratic constraints (Q265137) (← links)
- On zero duality gap in nonconvex quadratic programming problems (Q421278) (← links)
- Clustering and the perturbed spatial median (Q611736) (← links)
- Necessary global optimality conditions for nonlinear programming problems with polynomial constraints (Q623367) (← links)
- Sufficient global optimality conditions for bivalent quadratic optimization (Q702386) (← links)
- Beyond convex? global optimization is feasible only for convex objective functions: a theorem (Q816060) (← links)
- Necessary and sufficient global optimality conditions for NLP reformulations of linear SDP problems (Q839323) (← links)
- Global optimality conditions for some classes of optimization problems (Q970570) (← links)
- Non-convex quadratic minimization problems with quadratic constraints: global optimality conditions (Q985310) (← links)
- Optimality conditions in global optimization and their applications (Q1016343) (← links)
- Global optimality conditions for nonconvex optimization (Q1265197) (← links)
- A parametric characterization of local optimality (Q1395148) (← links)
- An iterative approach to quadratic optimization (Q1411485) (← links)
- Optimality conditions and optimization methods for quartic polynomial optimization (Q1646197) (← links)
- Theorems of the alternative for inequality systems of real polynomials (Q1762405) (← links)
- Interior optima and the Inada conditions (Q1934757) (← 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)
- Selected applications of linear semi-infinite systems theory (Q2022431) (← links)
- Local search with groups of step sizes (Q2060555) (← links)
- DC semidefinite programming and cone constrained DC optimization. I: Theory (Q2149953) (← links)
- On quadratically constrained quadratic optimization problems and canonical duality theory (Q2228397) (← links)
- New global optimality conditions for nonsmooth DC optimization problems (Q2301178) (← links)
- Global optimality conditions for nonlinear programming problems with linear equality constraints (Q2336220) (← links)
- Necessary and sufficient condition on global optimality without convexity and second order differentiability (Q2377213) (← links)
- Sufficient global optimality conditions for weakly convex minimization problems (Q2426678) (← links)
- Sufficient global optimality conditions for non-convex quadratic minimization problems with box constraints (Q2433932) (← links)
- Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints (Q2471081) (← links)
- On the global optimality of generalized trust region subproblems (Q3066926) (← links)
- Sufficient global optimality conditions for multi-extremal smooth minimisation problems with bounds and linear matrix inequality constraints (Q3430018) (← links)
- Global optimality conditions for nonlinear programming problems with bounds via quadratic underestimators (Q3553760) (← links)
- On semidefinite bounds for maximization of a non-convex quadratic objective over the<i>l<sub>1</sub></i>unit ball (Q3635701) (← links)
- Characterizing optimality in nonconvex optimization (Q3991498) (← links)
- A sufficient conditions for global quadratic optimization (Q5147640) (← links)
- Global optimality of quadratic minimization over symmetric polytopes (Q5426965) (← links)
- The method of codifferential descent for convex and global piecewise affine optimization (Q5859002) (← links)
- Mathematical properties of optimization problems defined by positively homogeneous functions (Q5959899) (← links)
- Duality and optimality conditions for reverse convex programs via a convex decomposition (Q6183466) (← links)
- Necessary optimality conditions for vector reverse convex minimization problems via a conjugate duality (Q6189128) (← links)