The following pages link to (Q4833806):
Displaying 50 items.
- Global optimality conditions for nonconvex minimization problems with quadratic constraints (Q265137) (← links)
- Computation of general correlation coefficients for interval data (Q274447) (← links)
- Call option price function in Bernstein polynomial basis with no-arbitrage inequality constraints (Q295013) (← links)
- Global optimization of bilinear programs with a multiparametric disaggregation technique (Q386453) (← links)
- On box constrained concave quadratic optimization (Q398648) (← links)
- The profit maximization problem in economies of scale (Q415243) (← links)
- Global optimal solutions to a class of quadrinomial minimization problems with one quadratic constraint (Q421276) (← links)
- Reduced RLT representations for nonconvex polynomial programming problems (Q427362) (← links)
- An LPCC approach to nonconvex quadratic programs (Q431005) (← links)
- Global optimality conditions and optimization methods for polynomial programming problems (Q496629) (← links)
- Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach (Q604257) (← links)
- Global optimization over a box via canonical dual function (Q609201) (← links)
- A new global optimization algorithm for solving generalized geometric programming (Q624692) (← links)
- Maximizing strictly convex quadratic functions with bounded perturbations (Q639197) (← links)
- Applying the canonical dual theory in optimal control problems (Q693127) (← links)
- A new linearization technique for multi-quadratic 0-1 programming problems. (Q703274) (← links)
- A technique for adaptive scheduling of soft real-time tasks (Q813149) (← links)
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation (Q820743) (← links)
- Solution to nonconvex quadratic programming with both inequality and box constraints (Q833456) (← links)
- Bilinear modeling solution approach for fixed charge network flow problems (Q839798) (← links)
- On generalized geometric programming problems with non-positive variables (Q857357) (← links)
- A new rectangle branch-and-pruning approach for generalized geometric programming (Q865546) (← links)
- A new global optimization algorithm for signomial geometric programming via Lagrangian relaxation (Q879567) (← links)
- Global maximization of a generalized concave multiplicative function (Q927239) (← links)
- Global minimization of difference of quadratic and convex functions over box or binary constraints (Q928298) (← links)
- A computational comparison of some branch and bound methods for indefinite quadratic programs (Q940829) (← links)
- Global optimization by canonical dual function (Q964977) (← links)
- An outcome space approach for generalized convex multiplicative programs (Q969745) (← links)
- Global optimality conditions for some classes of optimization problems (Q970570) (← links)
- Solution to an optimal control problem via canonical dual method (Q983361) (← links)
- Solutions to quadratic minimization problems with box and integer constraints (Q989896) (← links)
- Lagrange multiplier necessary conditions for global optimality for non-convex minimization over a quadratic constraint via S-lemma (Q1001322) (← links)
- A study on concave optimization via canonical dual function (Q1002175) (← links)
- Bidimensional packing by bilinear programming (Q1016113) (← links)
- New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems (Q1371947) (← links)
- Global optimization of signomial geometric programming using linear relaxation. (Q1428180) (← links)
- Optimality conditions and optimization methods for quartic polynomial optimization (Q1646197) (← links)
- A global optimization algorithm for signomial geometric programming problem (Q1722230) (← links)
- On approximation algorithms for concave mixed-integer quadratic programming (Q1800986) (← links)
- Separation and relaxation for cones of quadratic forms (Q1942279) (← links)
- Solution to singular optimal control by backward differential flow (Q1953741) (← links)
- A new algorithm for concave quadratic programming (Q2010088) (← links)
- Quadratic maximization of reachable values of affine systems with diagonalizable matrix (Q2032024) (← links)
- An efficient global algorithm for worst-case linear optimization under uncertainties based on nonlinear semidefinite relaxation (Q2044572) (← links)
- Global optimality condition for quadratic optimization problems under data uncertainty (Q2045908) (← links)
- A new concave minimization algorithm for the absolute value equation solution (Q2047210) (← links)
- A combinatorial optimization approach to scenario filtering in portfolio selection (Q2146965) (← links)
- Maximization of a PSD quadratic form and factorization (Q2230781) (← links)
- A fully general, exact algorithm for nesting irregular shapes (Q2250088) (← links)
- Global optimality conditions for nonlinear programming problems with linear equality constraints (Q2336220) (← links)
