A convex analysis approach for convex multiplicative programming

DOI10.1007/s10898-007-9267-5zbMath1152.90561OpenAlexW2001725593MaRDI QIDQ934807

Rúbia M. Oliveira, Paulo Augusto Valente Ferreira

Publication date: 30 July 2008

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-007-9267-5

zbMATH Keywords

Global optimizationConvex analysisNumerical methodsMultiplicative programming

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (8)

Theoretical and computational results about optimality-based domain reductions ⋮ Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms ⋮ Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems ⋮ A branch-and-cut algorithm for a class of sum-of-ratios problems ⋮ An objective space cut and bound algorithm for convex multiplicative programmes ⋮ An outcome space approach for generalized convex 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

Uses Software

• Matlab

Cites Work

• Unnamed Item
• Unnamed Item
• An outer approximation method for minimizing the product of several convex functions on a convex set
• Convergence and application of a decomposition method using duality bounds for nonconvex global optimization
• On-line and off-line vertex enumeration by adjacency lists
• A global optimization approach for solving the convex multiplicative programming problem
• Linear multiplicative programming
• Global minimization of a generalized convex multiplicative function
• Primal-relaxed dual global optimization approach
• Generalized convex multiplicative programming via quasiconcave minimization
• Multiplicative programming problems: Analysis and efficient point search heuristic
• Global optimization of multiplicative programs
• On duality for a class of quasiconcave multiplicative programs
• A finite algorithm for a class of nonlinear multiplicative programs
• An outcome space branch and bound-outer approximation algorithm for convex multiplicative programming
• Heuristic methods for linear multiplicative programming
• Outcome-space cutting-plane algorithm for linear multiplicative programming
• A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program
• Introduction to global optimization
• Solving multiple-objective problems in the objective space
• Generalized Benders decomposition
• Solving Bicriterion Mathematical Programs
• Convex Analysis
• Analysis of bounds for multilinear functions
• A finite branch-and-bound algorithm for linear multiplicative programming

This page was built for publication: A convex analysis approach for convex multiplicative programming