An application of Lipschitzian global optimization to product design
From MaRDI portal
Publication:1200528
DOI10.1007/BF00130833zbMath0752.90066OpenAlexW1981400809MaRDI QIDQ1200528
János D. Pintér, Eligius M. T. Hendrix
Publication date: 16 January 1993
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00130833
product designimplementationfeasible mixture designsLipschitzian global optimizationsimplicial partition strategy
Applications of mathematical programming (90C90) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (5)
New LP bound in multivariate Lipschitz optimization: Theory and applications ⋮ Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints ⋮ The semi-continuous quadratic mixture design problem: description and branch-and-bound approach ⋮ Convergence qualification of adaptive partition algorithms in global optimization ⋮ Finding robust solutions for product design problems
Cites Work
- Unnamed Item
- Jointly constrained bilinear programs and related problems: An overview
- Extended univariate algorithms for \(n\)-dimensional global optimization
- A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
- On the convergence of global methods in multiextremal optimization
- An algorithm for global optimization of Lipschitz continuous functions
- Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
- Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
- Global minimization of indefinite quadratic problems
- Constrained global optimization: algorithms and applications
- I-divergence geometry of probability distributions and minimization problems
- Linearly constrained estimation by mathematical programming
- Customizing methods for global optimization -- a geometric viewpoint
- Lewy's theorem fails in higher dimensions.
- Jointly Constrained Biconvex Programming
- An algorithm for finding the global maximum of a multimodal, multivariate function
- Stochastic global optimization methods part I: Clustering methods
- Stochastic global optimization methods part II: Multi level methods
- Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
- A bilinear approach to the pooling problem†
- A Sequential Method Seeking the Global Maximum of a Function
This page was built for publication: An application of Lipschitzian global optimization to product design
