Pages that link to "Item:Q1850844"
From MaRDI portal
The following pages link to Global optimality conditions in maximizing a convex quadratic function under convex quadratic constraints (Q1850844):
Displaying 35 items.
- Global optimality conditions for nonconvex minimization problems with quadratic constraints (Q265137) (← links)
- Global quadratic minimization over bivalent constraints: necessary and sufficient global optimality condition (Q415403) (← links)
- On zero duality gap in nonconvex quadratic programming problems (Q421278) (← links)
- Unboundedness in reverse convex and concave integer programming (Q604803) (← links)
- Sufficient global optimality conditions for bivalent quadratic optimization (Q702386) (← links)
- Global optimality conditions for cubic minimization problems with cubic constraints (Q907371) (← links)
- Global minimization of difference of quadratic and convex functions over box or binary constraints (Q928298) (← 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)
- Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma (Q1001322) (← links)
- Conditions for boundedness in concave programming under reverse convex and convex constraints (Q1006541) (← links)
- Optimality conditions in global optimization and their applications (Q1016343) (← links)
- Matrix pencils and existence conditions for quadratic programming with a sign-indefinite quadratic equality constraint (Q1041439) (← links)
- Optimality conditions and optimization methods for quartic polynomial optimization (Q1646197) (← links)
- Global optimality conditions and optimization methods for constrained polynomial programming problems (Q1663418) (← links)
- Global optimality conditions for fixed charge quadratic programs (Q1670551) (← 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)
- Semidefinite program duals for separable polynomial programs involving box constraints (Q1985290) (← links)
- Global optimality conditions for quadratic \(0-1\) optimization problems (Q2269587) (← links)
- Global optimality conditions for nonlinear programming problems with linear equality constraints (Q2336220) (← links)
- A secure control framework for resource-limited adversaries (Q2342524) (← links)
- Narrowing the difficulty gap for the Celis-Dennis-Tapia problem (Q2349132) (← 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)
- Global optimality principles for polynomial optimization over box or bivalent constraints by separable polynomial approximations (Q2442635) (← links)
- Sufficient conditions for global optimality of bivalent nonconvex quadratic programs with inequality constraints (Q2471081) (← links)
- On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions (Q2677662) (← links)
- Q-subdifferential and Q-conjugate for global optimality (Q2940369) (← 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)
- FROM SMILE ASYMPTOTICS TO MARKET RISK MEASURES (Q5247426) (← links)
- Mathematical properties of optimization problems defined by positively homogeneous functions (Q5959899) (← links)
- On second-order conic programming duals for robust convex quadratic optimization problems (Q6160375) (← links)