A numerical approach for solving some convex maximization problems

DOI10.1007/S10898-005-3271-4zbMath1104.90037OpenAlexW2067684924MaRDI QIDQ2505559

Masaru Kamada, B. Barsbold, Rentsen Enkhbat

Publication date: 26 September 2006

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-005-3271-4

zbMATH Keywords

algorithmglobal optimizationconcave programmingglobal maximizersimple set

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (5)

Piece adding technique for convex maximization problems ⋮ Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints ⋮ Strongly convex set-valued maps ⋮ Outlier detection and least trimmed squares approximation using semi-definite programming ⋮ Attractive force search algorithm for piecewise convex maximization problems

Cites Work

• The gap function of a convex program
• A new technique for generating quadratic programming test problems
• An algorithm for maximizing a convex function over a simple set
• Methods for Global Concave Minimization: A Bibliographic Survey

This page was built for publication: A numerical approach for solving some convex maximization problems