A parametric successive underestimation method for convex multiplicative programming problems
From MaRDI portal
Recommendations
- A PARAMETRIC SUCCESSIVE UNDERESTIMATION METHOD FOR CONVEX PROGRAMMING PROBLEMS WITH AN ADDITIONAL CONVEX MULTIPLICATIVE CONSTRAINT
- An algorithm for approximate multiparametric convex programming
- A parametric method for solving linear multiplicative programming problem
- A convex analysis approach for convex multiplicative programming
- A new global optimization approach for convex multiplicative programming
- A parameter-free multiplier method for constrained minimization problems
- A global optimization approach for solving the convex multiplicative programming problem
- Publication:5751489
- scientific article; zbMATH DE number 4031406
- Approximating parameterized convex optimization problems
Cites work
- scientific article; zbMATH DE number 3854804 (Why is no real title available?)
- scientific article; zbMATH DE number 47153 (Why is no real title available?)
- scientific article; zbMATH DE number 3456685 (Why is no real title available?)
- scientific article; zbMATH DE number 3466822 (Why is no real title available?)
- scientific article; zbMATH DE number 3227649 (Why is no real title available?)
- scientific article; zbMATH DE number 3284927 (Why is no real title available?)
- scientific article; zbMATH DE number 3308846 (Why is no real title available?)
- scientific article; zbMATH DE number 3356443 (Why is no real title available?)
- A Successive Underestimation Method for Concave Minimization Problems
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
- Constrained global optimization: algorithms and applications
- Function minimization by conjugate gradients
- Generalized linear multiplicative and fractional programming
- On a class of quadratic programs
- Parametric simplex algorithms for solving a special class of nonconvex minimization problems
- Quasi-concavity and pseudo-concavity of cubic functions
- Solving Bicriterion Mathematical Programs
Cited in
(24)- Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms
- Global optimization algorithm for a generalized linear multiplicative programming
- Branch-and-bound decomposition approach for solving quasiconvex-concave programs
- A branch-and-reduce approach to global optimization
- A fifth bibliography of fractional programming*
- A new global optimization approach for convex multiplicative programming
- \(NP\)-hardness of linear multiplicative programming and related problems
- An outer approximation method for minimizing the product of several convex functions on a convex set
- The simplex method as a global optimizer: A \(C\)-programming perspective
- Level set algorithm for solving convex multiplicative programming problems
- Global optimization for robust control synthesis based on the matrix product eigenvalue problem
- Linear multiplicative programming
- Multiplicative programming problems: Analysis and efficient point search heuristic
- Global minimization of a generalized convex multiplicative function
- A global optimization approach for solving the convex multiplicative programming problem
- On jet-convex functions and their tensor products
- A convex analysis approach for convex multiplicative programming
- Convex programs with an additional constraint on the product of several convex functions
- A method based on parametric convex programming for solving convex multiplicative programming problem
- Globally determining a minimum-area rectangle enclosing the projection of a higher-dimensional set
- Linear programs with an additional rank two reverse convex constraint
- The complementary convex structure in global optimization
- A global optimization method for minimizing a product of two positive convex functions
- On duality for a class of quasiconcave multiplicative programs
This page was built for publication: A parametric successive underestimation method for convex multiplicative programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1200637)
