Piyavskij's method for solving the general global optimization problem
From MaRDI portal
The general global optimization problem with nonlinear constraints (equalities and inequalities) is considered. The author proposes a method of sequential approximation of such a problem by multiextremal problems of special form. The approximated problems are reduced then to concave or dual concave programming problems. Several algorithms for solving auxiliary subproblems are proposed.
Recommendations
- A method for solution of special problems of global minimization
- scientific article; zbMATH DE number 47153
- A new auxiliary function method for general constrained global optimization
- scientific article; zbMATH DE number 4031409
- On outer approximation methods for solving concave minimization problems
Cited in
(11)- The Montagne Russe algorithm for global optimization
- Optimization models of anti-terrorist protection
- Minorant methods of stochastic global optimization
- An implicit enumeration method for global optimization problems
- Global optimization: a naive approach
- scientific article; zbMATH DE number 4123538 (Why is no real title available?)
- A global optimization approach to a number theory problem
- Parallel global optimization algorithm with uniform convergence for solving a set of constrained global optimization problems
- Optimization of the optimal value function in problems of convex parametric programming
- An algorithm for finding a root of a nonnegative multimodal function
- Reliability optimization of a complex system by the stochastic branch and bound method
This page was built for publication: Piyavskij's method for solving the general global optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1802574)
