Minimum search in concave problems, using the sufficient condition for a global extremum
From MaRDI portal
Publication:3712131
DOI10.1016/0041-5553(85)90052-7zbMATH Open0585.90074OpenAlexW2073253920MaRDI QIDQ3712131
Publication date: 1985
Published in: USSR Computational Mathematics and Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0041-5553(85)90052-7
Numerical mathematical programming methods (65K05) Convex programming (90C25) Methods of successive quadratic programming type (90C55)
Related Items (2)
The search for a global minimum in problems of nonconvex programming with dependences that are biseparable superpositions of convex functions ⋮ Sufficient conditions for the convergence of non-autonomous stochastic search for a global minimum
This page was built for publication: Minimum search in concave problems, using the sufficient condition for a global extremum
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3712131)
