An application of Lipschitzian global optimization to product design

DOI10.1007/BF00130833zbMATH Open0752.90066OpenAlexW1981400809MaRDI QIDQ1200528FDOQ1200528

Authors: E. M. T. Hendrix, János Pinter 

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

Recommendations

• Global optimization under Lipschitzian constraints
• An optimization framework for product design
• An optimization problem with applications to optimal design theory
• scientific article; zbMATH DE number 757681
• On using estimates of Lipschitz constants in global optimization
• scientific article; zbMATH DE number 4062842
• Lipschitz global optimization methods in control problems
• An algorithm for global optimization of Lipschitz continuous functions
• Topics in Lipschitz global optimisation

zbMATH Keywords

product designimplementationfeasible mixture designsLipschitzian global optimizationsimplicial partition strategy

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Cites Work

• Title not available (Why is that?)
• A Sequential Method Seeking the Global Maximum of a Function
• A bilinear approach to the pooling problem†
• A general class of branch-and-bound methods in global optimization with some new approaches for concave minimization
• An algorithm for finding the global maximum of a multimodal, multivariate function
• An algorithm for global optimization of Lipschitz continuous functions
• Branch- and bound algorithms for solving global optimization problems with Lipschitzian structure
• Branch-and-bound methods for solving systems of Lipschitzian equations and inequalities
• Constrained global optimization: algorithms and applications
• Customizing methods for global optimization -- a geometric viewpoint
• Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
• Extended univariate algorithms for \(n\)-dimensional global optimization
• Global minimization of indefinite quadratic problems
• I-divergence geometry of probability distributions and minimization problems
• Jointly Constrained Biconvex Programming
• Jointly constrained bilinear programs and related problems: An overview
• Lewy's theorem fails in higher dimensions.
• Linearly constrained estimation by mathematical programming
• On the convergence of global methods in multiextremal optimization
• Stochastic global optimization methods part I: Clustering methods
• Stochastic global optimization methods part II: Multi level methods

Cited In (6)

• Interval global optimization in solvent design
• Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
• Finding robust solutions for product design problems
• Convergence qualification of adaptive partition algorithms in global optimization
• The semi-continuous quadratic mixture design problem: description and branch-and-bound approach
• New LP bound in multivariate Lipschitz optimization: Theory and applications

This page was built for publication: An application of Lipschitzian global optimization to product design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200528)