A survey of methods of abstract convex programming

DOI10.1080/09720510.2002.10701049MaRDI QIDQ5708462zbMATH OpenOpenAlexFDO

Authors Mikhail Andramonov

Publication date 18 November 2005

Published in Journal of Statistics and Management Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/09720510.2002.10701049

Mathematics Subject Classification ID

Convex programming (90C25) Programming in abstract spaces (90C48) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Abstract convexity and global optimization
• Abstract convexity and solvability theorems
• A review of applications of the cutting angle methods
• scientific article; zbMATH DE number 195045
• Convergence of a numerical abstract convexity algorithm

Cited in

(11)

• Abstract convexity, global optimization and data classification.
• Convex Parametric Programming in Abstract Spaces
• Zero duality gap conditions via abstract convexity
• Generalized cutting plane method for solving nonlinear stochastic programming problems
• Abstract convexity and solvability theorems
• A review of applications of the cutting angle methods
• Duality for composite optimization problem within the framework of abstract convexity
• Abstract convexity and global optimization
• Variational properties of the abstract subdifferential operator
• Characterisation of zero duality gap for optimization problems in spaces without linear structure
• Proximal algorithms for a class of abstract convex functions

This page was built for publication: A survey of methods of abstract convex programming

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