scientific article; zbMATH DE number 757680
From MaRDI portal
Publication:4833809
zbMath0832.90105MaRDI QIDQ4833809
Publication date: 23 May 1995
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
global optimizationparametric simplex methodmultiplicative programmingouter approximation methodproduct of convex functionssuccessive underestimation method
Convex programming (90C25) Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation, Global optimization of a rank-two nonconvex program, Data separation via a finite number of discriminant functions: a global optimization approach, Minimizing a linear multiplicative-type function under network flow constraints, Multiplicative programming problems: Analysis and efficient point search heuristic, A survey of hidden convex optimization, Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms, A parametric approach for solving a class of generalized quadratic-transformable rank-two nonconvex programs, Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems, A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints, An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint, On the solution of generalized multiplicative extremum problems, Solving linear fractional bilevel programs., Solving a class of multiplicative programs with 0-1 knapsack constraints, Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm, A convex analysis approach for convex multiplicative programming, A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints, Solving fractional problems with dynamic multistart improving hit-and-run, Approximation of linear fractional-multiplicative problems, An outcome space approach for generalized convex multiplicative programs, Convexity conditions of Kantorovich function and related semi-infinite linear matrix inequalities, Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint, Underestimation functions for a rank-two partitioning method, Nonlinear separation of data via mixed 0-1 integer and linear programming, A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions, Branch-and-reduce algorithm for convex programs with additional multiplicative constraints, \(NP\)-hardness of linear multiplicative programming and related problems, Outcome-space cutting-plane algorithm for linear multiplicative programming, Level set algorithm for solving convex multiplicative programming problems
