Optimizing color picture tubes by high-cost nonlinear programming

DOI10.1016/S0377-2217(02)00063-2zbMATH Open1001.90520MaRDI QIDQ1598751FDOQ1598751

D. Den Hertog, Peter Stehouwer

Publication date: 28 May 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

simulationnonlinear programmingengineering designdesign of computer experimentscompact modeling

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonlinear programming (90C30)

Cites Work

• CONOPT—A Large-Scale GRG Code
• Design and analysis of computer experiments. With comments and a rejoinder by the authors
• On the Convergence of the Multidirectional Search Algorithm
• On the Convergence of Pattern Search Algorithms

Cited In (11)

• One-dimensional nested maximin designs
• Completion of partial Latin hypercube designs: NP-completeness and inapproximability
• Robust optimization using computer experiments
• Computing the Maximum Volume Inscribed Ellipsoid of a Polytopic Projection
• Space-filling Latin hypercube designs for computer experiments
• On \(D\)-optimality based trust regions for black-box optimization problems
• On convex quadratic approximation
• Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints
• Constrained optimization involving expensive function evaluations: A sequential approach
• Nested maximin Latin hypercube designs
• Finding maximin Latin hypercube designs by iterated local search heuristics

Uses Software

• CONOPT

This page was built for publication: Optimizing color picture tubes by high-cost nonlinear programming

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