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