Convergence of a numerical abstract convexity algorithm

DOI10.1070/IM2009V073N01ABEH002435MaRDI QIDQ3626973zbMATH OpenOpenAlexWikidataFDO

Authors M. Yu. Andramonov

Publication date 14 May 2009

Published in Izvestiya: Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1070/im2009v073n01abeh002435

zbMATH Keywords

abstract convex analysisbranching algorithmgeneralized cutting-plane methodglobal optimization

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• Convergence of some algorithms for convex minimization
• scientific article; zbMATH DE number 774630
• scientific article; zbMATH DE number 3856303
• A Convergent Procedure for Convex Programming
• scientific article; zbMATH DE number 763870
• scientific article; zbMATH DE number 30187
• scientific article; zbMATH DE number 4083374
• Convergence in approximation and nonsmooth analysis
• scientific article; zbMATH DE number 972687
• scientific article; zbMATH DE number 1281608

Cited in

(7)

• Radiant separation theorems and minimum-type subdifferentials of calm functions
• Convex programming for disjunctive convex optimization
• Numerical algorithm of Riesz projection and its convergence
• Convergence of an algorithm simulating Loewner curves
• Numerical studies on the globally convergent convexification algorithm in 2D
• Convergence of a Constrained Vector Extrapolation Scheme
• A survey of methods of abstract convex programming

This page was built for publication: Convergence of a numerical abstract convexity algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3626973)