Piyavskij's method for solving the general global optimization problem
From MaRDI portal
Publication:1802574
zbMATH Open0777.90080MaRDI QIDQ1802574FDOQ1802574
Authors: Vladimir I. Norkin 
Publication date: 6 September 1993
Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
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
global optimizationnonconvex approximationsnonlinear constraintssequential approximationdual concave programming
Cited In (10)
- Minorant methods of stochastic global optimization
- The Montagne Russe algorithm for global optimization
- Global optimization: a naive approach
- Optimization of the optimal value function in problems of convex parametric programming
- Title not available (Why is that?)
- An implicit enumeration method for global optimization problems
- A global optimization approach to a number theory problem
- Optimization models of anti-terrorist protection
- Reliability optimization of a complex system by the stochastic branch and bound method
- Parallel global optimization algorithm with uniform convergence for solving a set of constrained global optimization problems
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)
