The following pages link to (Q3761588):
Displaying 30 items.
- Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications (Q811400) (← links)
- A finite cutting plane method for solving linear programs with an additional reverse convex constraint (Q910336) (← links)
- The design centering problem as a d.c. programming problem (Q1106730) (← links)
- Normal conical algorithm for concave minimization over polytopes (Q1177231) (← links)
- On-line and off-line vertex enumeration by adjacency lists (Q1180822) (← links)
- Computing a global optimal solution to a design centering problem (Q1184340) (← links)
- Unconstrained 0-1 nonlinear programming: A nondifferentiable approach (Q1187840) (← links)
- The simplex method as a global optimizer: A \(C\)-programming perspective (Q1315444) (← links)
- A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems (Q1321648) (← links)
- Global optimization conditions for certain nonconvex minimization problems (Q1342899) (← links)
- Deterministic global optimization of process flowsheets in a reduced space using McCormick relaxations (Q1685576) (← links)
- On some geometric conditions for minimality of DCH-functions via DC-duality approach (Q1685589) (← links)
- DC decomposition of nonconvex polynomials with algebraic techniques (Q1749445) (← links)
- Difference of convex solution of quadratically constrained optimization problems. (Q1810525) (← links)
- Convex minimization under Lipschitz constraints (Q1823144) (← links)
- A new class of multilevel decomposition algorithms for non-monotone problems based on the quasidifferentiability concept (Q1913139) (← links)
- Canonical DC programming problem: Outer approximation methods revisited (Q1919172) (← links)
- Beyond canonical dc-optimization: the single reverse polar problem (Q1935286) (← links)
- Support points (Q1991669) (← links)
- DC semidefinite programming and cone constrained DC optimization. I: Theory (Q2149953) (← links)
- SUSPECT: MINLP special structure detector for Pyomo (Q2182769) (← links)
- Variations and extension of the convex-concave procedure (Q2358020) (← links)
- The \(C_ M\)-embedded problem and optimality conditions (Q2640868) (← links)
- Global optimization under Lipschitzian constraints (Q3760303) (← links)
- (Q4980717) (← links)
- Intersection Disjunctions for Reverse Convex Sets (Q5076701) (← links)
- Convex Maximization via Adjustable Robust Optimization (Q5106408) (← links)
- Deterministic global optimization using interval constraint propagation techniques (Q5693008) (← links)
- (Q5696799) (← links)
- Global Optimization and Constraint Satisfaction (Q5897043) (← links)
