Integral global minimization: Algorithms, implementations and numerical tests
From MaRDI portal
Publication:1913610
DOI10.1007/BF01099651zbMATH Open0846.90105OpenAlexW2023726242MaRDI QIDQ1913610FDOQ1913610
Authors: 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
Recommendations
- Optimality conditions and algorithms for integral global minimization
- Integral global optimization. Theory, implementation and applications
- Integral global optimization method for solution of nonlinear complementarity problems
- scientific article; zbMATH DE number 27250
- scientific article; zbMATH DE number 2076008
- Integral global minimization of constrained problems with discontinuous penalty functions
- A primal-dual integral method in global optimization
- Implementation of global optimization and comparison with several deviation integral algorithms
- INTLAB implementation of an interval global optimization algorithm
- Methods for Global Concave Minimization: A Bibliographic Survey
test problemsMonte Carlo implementationrobustificationintegral global optimizationdiscontinuous penalty method
Cites Work
- Title not available (Why is that?)
- Global optimization by controlled random search
- Constrained global optimization: algorithms and applications
- Title not available (Why is that?)
- More test examples for nonlinear programming codes
- Test examples for nonlinear programming codes
- Integral global optimization. Theory, implementation and applications
- The Tunneling Algorithm for the Global Minimization of Functions
- Exact Penalty Functions in Constrained Optimization
- Robust analysis and global optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms
- Monte Carlo optimization
- Robust analysis and global minimization of a class of discontinuous functions. II
- Global minimization of constrained problems with discontinuous penalty functions
- Robust analysis and global minimization of a class of discontinuous functions. I
- Finite dimensional approximation to solutions of minimization problems in functional spaces
- Method for minimizing a convex-concave function over a convex set
- A method for solving maximum-problems with a nonconcave quadratic objective function
- An algorithm for the solution of constrained generalised polynomial programming problems
- Set-valued robust mappings and approximable mappings
Cited In (25)
- Nonsmooth bundle trust-region algorithm with applications to robust stability
- Integral global minimization of constrained problems with discontinuous penalty functions
- Integral global optimality conditions and an algorithm for multiobjective problems
- Integral global optimization method in statistical applications
- The robust constant and its applications in global optimization
- A filled function method with one parameter for box constrained global optimization
- The robust constant and its applications in random global search for unconstrained global optimization
- Comparison of public-domain software for black box global optimization∗
- Discrete global descent method for discrete global optimization and nonlinear integer programming
- Optimality condition and algorithm with deviation integral for global optimization
- A sufficient and necessary condition for global optimization
- Discrete filled function method for discrete global optimization
- Integral global optimization. Theory, implementation and applications
- Implementation of global optimization and comparison with several deviation integral algorithms
- A filled function method for global optimization
- A discrete dynamic convexized method for nonlinear integer programming
- An approach to multi-start clustering for global optimization with non-linear constraints
- Finding discrete global minima with a filled function for integer programming
- A criterion for an approximation global optimal solution based on the filled functions
- Studies of multi-start clustering for global optimization
- Optimality conditions and algorithms for integral global minimization
- A parameter-free filled function for unconstrained global optimization
- Branch and bound algorithm with applications to robust stability
- Title not available (Why is that?)
- Optimization methods for box-constrained nonlinear programming problems based on linear transformation and Lagrange interpolating polynomials
This page was built for publication: Integral global minimization: Algorithms, implementations and numerical tests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1913610)
