Pages that link to "Item:Q1106730"
From MaRDI portal
The following pages link to The design centering problem as a d.c. programming problem (Q1106730):
Displaying 12 items.
- A level set algorithm for a class of reverse convex programs (Q751513) (← links)
- On the use of cuts in reverse convex programs (Q913668) (← links)
- Computing a global optimal solution to a design centering problem (Q1184340) (← links)
- On solving a d.c. programming problem by a sequence of linear programs (Q1186273) (← links)
- Calculation of bounds on variables satisfying nonlinear inequality constraints (Q1207040) (← links)
- Geometric metrology. I: Separation functionals in tolerance assessment (Q1387905) (← links)
- Convex minimization under Lipschitz constraints (Q1823144) (← links)
- DC programming: overview. (Q1969457) (← links)
- On solving general reverse convex programming problems by a sequence of linear programs and line searches (Q2638938) (← links)
- Global optimization under Lipschitzian constraints (Q3760303) (← links)
- Gauge distances and median hyperplanes (Q5947268) (← links)
- Counterfactual analysis and target setting in benchmarking (Q6586234) (← links)
