Pages that link to "Item:Q3760303"
From MaRDI portal
The following pages link to Global optimization under Lipschitzian constraints (Q3760303):
Displaying 18 items.
- Dual and bidual problems for a Lipschitz optimization problem based on quasi-conjugation (Q631850) (← links)
- Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications (Q811400) (← links)
- An algorithm for global optimization of Lipschitz continuous functions (Q1090241) (← links)
- Convergence and restart in branch-and-bound algorithms for global optimization. Application to concave minimization and d.c. optimization problems (Q1106728) (← links)
- The design centering problem as a d.c. programming problem (Q1106730) (← links)
- On-line and off-line vertex enumeration by adjacency lists (Q1180822) (← links)
- An analytical approach to global optimization (Q1181733) (← links)
- An application of Lipschitzian global optimization to product design (Q1200528) (← links)
- On using estimates of Lipschitz constants in global optimization (Q1321252) (← links)
- Global optimization conditions for certain nonconvex minimization problems (Q1342899) (← links)
- Global optimization in Hilbert space (Q1717227) (← links)
- Convex minimization under Lipschitz constraints (Q1823144) (← links)
- D.c sets, d.c. functions and nonlinear equations (Q2367918) (← links)
- On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) (← links)
- (Q3559350) (← links)
- On an outer approximation concept in global optimization (Q3830824) (← links)
- (Q4302077) (← links)
- Global optimization in metric spaces with partial orders (Q5169459) (← links)
