Method for minimizing a convex-concave function over a convex set

DOI10.1007/BF00940633zbMath0743.90101OpenAlexW2069826748MaRDI QIDQ1176848

Werner Oettli, Le Dung Muu

Publication date: 25 June 1992

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00940633

zbMATH Keywords

global optimizationconvergencebranch-and-bounddifference of two convex functionsconvex-concave function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

Branch-and-bound decomposition approach for solving quasiconvex-concave programs, Decomposition methods for solving a class of nonconvex programming problems dealing with bilinear and quadratic functions, ON THE PROJECTION OF THE EFFICIENT SET AND POTENTIAL APPLICATIONS, Integral global minimization: Algorithms, implementations and numerical tests, Combined branch-and-bound and cutting plane methods for solving a class of nonlinear programming problems, An algorithm for solving convex programs with an additional convex- concave constraint, Convergence and application of a decomposition method using duality bounds for nonconvex global optimization, A jointly constrained bilinear programming method for solving generalized Cournot–Pareto models, Efficient algorithms for solving certain nonconvex programs dealing with the product of two affine fractional functions, Global optimization from concave minimization to concave mixed variational inequality, Decomposition branch-and-bound based algorithm for linear programs with additional multiplicative constraints

Cites Work

• On the convergence of global methods in multiextremal optimization
• Deterministic global optimization with partition sets whose feasibility is not known: Application to concave minimization, reserve convex constraints, DC-programming and Lipschitzian optimization
• Constrained global optimization: algorithms and applications
• On the convergence of two branch-and-bound algorithms for nonconvex programming problems
• An algorithm for indefinite quadratic programming with convex constraints
• Global minimization of large-scale constrained concave quadratic problems by separable programming
• Global minimization of a difference of two convex functions