Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Piyavskij's method for solving the general global optimization problem

From MaRDI portal
Publication:1802574
Jump to:navigation, search

zbMath0777.90080MaRDI QIDQ1802574

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)


Related Items (5)

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 ⋮ Optimization models of anti-terrorist protection ⋮ Reliability optimization of a complex system by the stochastic branch and bound method ⋮ Minorant methods of stochastic global optimization




This page was built for publication: Piyavskij's method for solving the general global optimization problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1802574&oldid=14161973"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 09:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki