The design centering problem as a d.c. programming problem
From MaRDI portal
Publication:1106730
DOI10.1007/BF01580765zbMath0651.90065MaRDI QIDQ1106730
Publication date: 1988
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
d.c. programmingMinkowski functionaldifference of two convex functionsdesign centeringreverse convex constraintsouter approximation algorithmcomplementary convex setsglobal minimization of concave functionsimproved solution algorithms
Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Numerical methods based on nonlinear programming (49M37)
Related Items
On solving general reverse convex programming problems by a sequence of linear programs and line searches, Geometric metrology. I: Separation functionals in tolerance assessment, Global optimization under Lipschitzian constraints, On the use of cuts in reverse convex programs, DC programming: overview., Computing a global optimal solution to a design centering problem, On solving a d.c. programming problem by a sequence of linear programs, Calculation of bounds on variables satisfying nonlinear inequality constraints, Gauge distances and median hyperplanes, A level set algorithm for a class of reverse convex programs, Convex minimization under Lipschitz constraints
Cites Work
- An outer approximation method for globally minimizing a concave function over a compact convex set
- On outer approximation methods for solving concave minimization problems
- Convex programs with an additional reverse convex constraint
- An implementable algorithm for the optimal design centering, tolerancing, and tuning problem
- A Variable-Complexity Norm Maximization Problem
- Global optimization under Lipschitzian constraints
- Unnamed Item
- Unnamed Item
- Unnamed Item
