scientific article; zbMATH DE number 757680
From MaRDI portal
Publication:4833809
Recommendations
Cited in
(36)- An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint
- On a multiplicative hybrid problem
- Solving a class of multiplicative programming problems via \(C\)- programming
- Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms
- Multiplicative programming and beyond via \(C\)-programming.
- Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint
- Convexity conditions of Kantorovich function and related semi-infinite linear matrix inequalities
- On linear multiplicative programming.
- A method of acceleration for a class of multiplicative programming problems with exponent
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
- Approximation of linear fractional-multiplicative problems
- Underestimation functions for a rank-two partitioning method
- A parametric approach for solving a class of generalized quadratic-transformable rank-two nonconvex programs
- Global optimization of a rank-two nonconvex program
- A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions
- A survey of hidden convex optimization
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems
- Solving a class of multiplicative programs with 0-1 knapsack constraints
- Solving fractional problems with dynamic multistart improving hit-and-run
- \(NP\)-hardness of linear multiplicative programming and related problems
- Minimizing a linear multiplicative-type function under network flow constraints
- A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints
- An outcome space approach for generalized convex multiplicative programs
- Level set algorithm for solving convex multiplicative programming problems
- Branch-and-reduce algorithm for convex programs with additional multiplicative constraints
- Nonlinear separation of data via mixed 0-1 integer and linear programming
- Multiplicative programming problems: Analysis and efficient point search heuristic
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
- Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm
- A global optimization approach for solving the convex multiplicative programming problem
- A convex analysis approach for convex multiplicative programming
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- A method based on parametric convex programming for solving convex multiplicative programming problem
- On the solution of generalized multiplicative extremum problems
- Data separation via a finite number of discriminant functions: a global optimization approach
- Solving linear fractional bilevel programs.
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4833809)
