Bounded lower subdifferentiability optimization techniques: applications

DOI10.1007/s10898-009-9467-2zbMath1190.90132OpenAlexW2042191477MaRDI QIDQ975769

Gleb Beliakov, Albert Ferrer

Publication date: 11 June 2010

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

Full work available at URL: https://doi.org/10.1007/s10898-009-9467-2

zbMATH Keywords

global optimizationcutting angle methodabstract convexityLipschitz and quasiconvex programming

Mathematics Subject Classification ID

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

Related Items (2)

A comparative note on the relaxation algorithms for the linear semi-infinite feasibility problem ⋮ Comparative study of RPSALG algorithm for convex semi-infinite programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower subdifferentiable functions and their minimization by cutting planes
• Fractional programming by lower subdifferentiability techniques
• Newton's method for convex programming and Tschebyscheff approximation
• Handbook of global optimization
• Quasiconvex optimization and location theory
• Fast algorithm for the cutting angle method of global optimization
• Cutting angle method – a tool for constrained global optimization
• The Cutting-Plane Method for Solving Convex Programs
• Geometry and combinatorics of the cutting angle method
• On Nonlinear Fractional Programming
• Method of centers for generalized fractional programming
• Abstract convexity and global optimization
• The generalized maximal covering location problem

This page was built for publication: Bounded lower subdifferentiability optimization techniques: applications