Piyavskij's method for solving the general global optimization problem

MaRDI QIDQ1802574zbMATH OpenFDO

Authors Vladimir I. Norkin

Publication date 6 September 1993

Published in Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

zbMATH Keywords

global optimizationnonconvex approximationsnonlinear constraintssequential approximationdual concave programming

Mathematics Subject Classification ID

Programming in abstract spaces (90C48)

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

(10)

• An implicit enumeration method for global optimization problems
• Reliability optimization of a complex system by the stochastic branch and bound method
• Global optimization: a naive approach
• The Montagne Russe algorithm for global optimization
• Optimization of the optimal value function in problems of convex parametric programming
• scientific article; zbMATH DE number 4123538 (Why is no real title available?)
• Parallel global optimization algorithm with uniform convergence for solving a set of constrained global optimization problems
• A global optimization approach to a number theory problem
• Optimization models of anti-terrorist protection
• Minorant methods of stochastic global optimization

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)