An outer approximation method for minimizing the product of several convex functions on a convex set
From MaRDI portal
Publication:686993
DOI10.1007/BF01096774zbMath0798.90117MaRDI QIDQ686993
Takahito Kuno, Yasutoshi Yajima, Hiroshi Konno
Publication date: 13 October 1993
Published in: Journal of Global Optimization (Search for Journal in Brave)
Nonconvex programming, global optimization (90C26) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Convex programs with an additional constraint on the product of several convex functions, A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming, On jet-convex functions and their tensor products, Solving a class of multiplicative programming problems via \(C\)- programming, A method of acceleration for a class of multiplicative programming problems with exponent, A FPTAS for a class of linear multiplicative problems, An outcome-space finite algorithm for solving linear multiplicative programming, An efficient algorithm for computing a class of multiplicative optimization problem, Multiplicative programming problems: Analysis and efficient point search heuristic, Linearization method for a class of multiplicative programming with exponent, Global optimization algorithm for solving linear multiplicative programming problems, An Outcome Space Branch-and-Bound Algorithm for a Class of Linear Multiplicative Programming Problems, An efficient spatial branch-and-bound algorithm using an adaptive branching rule for linear multiplicative programming, A global optimization approach for solving generalized nonlinear multiplicative programming problem, A convex analysis approach for convex multiplicative programming, An objective space cut and bound algorithm for convex multiplicative programmes, A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems, An outcome space approach for generalized convex multiplicative programs, A new global optimization approach for convex multiplicative programming, Unnamed Item, Duality for linear multiplicative programs, A new two-level linear relaxed bound method for geometric programming problems, Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs, A nonisolated optimal solution of general linear multiplicative programming problems, Solving the sum-of-ratios problem by a stochastic search algorithm, Solving generalized convex multiobjective programming problems by a normal direction method, Level set algorithm for solving convex multiplicative programming problems, A generalized Dantzig-Wolfe decomposition principle for a class of nonconvex programming problems, Global optimization method for linear multiplicative programming
Cites Work
- An outer approximation method for globally minimizing a concave function over a compact convex set
- On a class of quadratic programs
- Constrained global optimization: algorithms and applications
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- On-line and off-line vertex enumeration by adjacency lists
- Mathematical programs with a two-dimensional reverse convex constraint
- The complementary convex structure in global optimization
- A parametric successive underestimation method for convex multiplicative programming problems
- Linear multiplicative programming
- A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
- Generalized linear multiplicative and fractional programming
- Polynomial time algorithms for some classes of constrained nonconvex quadratic problems
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- Solving Bicriterion Mathematical Programs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
