Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type

DOI10.1007/BF02243814zbMath0796.90060MaRDI QIDQ685859

Nguyen Van Thoai

Publication date: 18 October 1993

Published in: Computing (Search for Journal in Brave)

zbMATH Keywords

global optimizationd.c. programmingouter approximationdifference of two convex functionsreverse convex constraint

Mathematics Subject Classification ID

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

Related Items

Constraint decomposition algorithms in global optimization, Decomposition approach for the global minimization of biconcave functions over polytopes, Reverse convex programming approach in the space of extreme criteria for optimization over efficient sets, On optimization over the efficient set in linear multicriteria programming, Convergence and application of a decomposition method using duality bounds for nonconvex global optimization, Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint, On Tikhonov's reciprocity principle and optimality conditions in d. c. optimization, Branch-and-reduce algorithm for convex programs with additional multiplicative constraints

Cites Work

• Unnamed Item
• Unnamed Item
• An algorithm for solving convex programs with an additional convex- concave constraint
• Outer approximation by polyhedral convex sets
• On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
• Mathematical programs with a two-dimensional reverse convex constraint
• The complementary convex structure in global optimization
• A collection of test problems for constrained global optimization algorithms
• A global optimization approach for solving the convex multiplicative programming problem
• Convex programs with an additional constraint on the product of several convex functions
• Generalized linear multiplicative and fractional programming
• Concave minimization under linear constraints with special structure
• A modified version of Tuy's method for solving d.c. programing problem
• BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
• On an outer approximation concept in global optimization
• A PARAMETRIC SUCCESSIVE UNDERESTIMATION METHOD FOR CONVEX PROGRAMMING PROBLEMS WITH AN ADDITIONAL CONVEX MULTIPLICATIVE CONSTRAINT
• Solving Bicriterion Mathematical Programs