Integral global minimization: Algorithms, implementations and numerical tests

DOI10.1007/BF01099651zbMath0846.90105OpenAlexW2023726242MaRDI QIDQ1913610

Quan Zheng, Deming Zhuang

Publication date: 22 May 1996

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01099651

zbMATH Keywords

test problemsrobustificationMonte Carlo implementationintegral global optimizationdiscontinuous penalty method

Mathematics Subject Classification ID

Nonlinear programming (90C30)

Related Items (21)

The robust constant and its applications in random global search for unconstrained global optimization ⋮ Studies of multi-start clustering for global optimization ⋮ An approach to multi-start clustering for global optimization with non-linear constraints ⋮ A filled function method for global optimization ⋮ A parameter-free filled function for unconstrained global optimization ⋮ Discrete global descent method for discrete global optimization and nonlinear integer programming ⋮ The Robust Constant and Its Applications in Global Optimization ⋮ Integral Global Optimality Conditions and an Algorithm for Multiobjective Problems ⋮ Optimality conditions and algorithms for integral global minimization ⋮ Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials ⋮ Branch and bound algorithm with applications to robust stability ⋮ A discrete dynamic convexized method for nonlinear integer programming ⋮ Finding discrete global minima with a filled function for integer programming ⋮ Discrete filled function method for discrete global optimization ⋮ A filled function method with one parameter for box constrained global optimization ⋮ Integral global minimization of constrained problems with discontinuous penalty functions ⋮ A criterion for an approximation global optimal solution based on the filled functions ⋮ Optimality condition and algorithm with deviation integral for global optimization ⋮ A sufficient and necessary condition for global optimization ⋮ Comparison of public-domain software for black box global optimization^∗ ⋮ Nonsmooth bundle trust-region algorithm with applications to robust stability

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Monte Carlo optimization
• Constrained global optimization: algorithms and applications
• More test examples for nonlinear programming codes
• Test examples for nonlinear programming codes
• Global optimization by controlled random search
• Method for minimizing a convex-concave function over a convex set
• Robust analysis and global minimization of a class of discontinuous functions. II
• Integral global optimization. Theory, implementation and applications
• Set-valued robust mappings and approximable mappings
• Global minimization of constrained problems with discontinuous penalty functions
• Robust analysis and global minimization of a class of discontinuous functions. I
• The Tunneling Algorithm for the Global Minimization of Functions
• Finite dimensional approximation to solutions of minimization problems in functional spaces
• Exact Penalty Functions in Constrained Optimization
• An algorithm for the solution of constrained generalised polynomial programming problems
• Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
• A method for solving maximum-problems with a nonconcave quadratic objective function
• Robust analysis and global optimization

This page was built for publication: Integral global minimization: Algorithms, implementations and numerical tests