scientific article; zbMATH DE number 757680
From MaRDI portal
Publication:4833809
zbMATH Open0832.90105MaRDI QIDQ4833809FDOQ4833809
Authors: Hiroshi Konno, Takahito Kuno 
Publication date: 23 May 1995
Title of this publication is not available (Why is that?)
Recommendations
global optimizationparametric simplex methodmultiplicative programmingouter approximation methodproduct of convex functionssuccessive underestimation method
Convex programming (90C25) Nonlinear programming (90C30) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Cited In (36)
- Convexity conditions and the Legendre-fenchel transform for the product of finitely many positive definite quadratic forms
- A new branch-and-cut algorithm for non-convex quadratic programming via alternative direction method and semidefinite relaxation
- Global optimization of a rank-two nonconvex program
- A parametric approach for solving a class of generalized quadratic-transformable rank-two nonconvex programs
- Solving a class of multiplicative programs with 0-1 knapsack constraints
- Convexity conditions of Kantorovich function and related semi-infinite linear matrix inequalities
- A global optimization approach for solving the convex multiplicative programming problem
- An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint
- Multiplicative programming and beyond via \(C\)-programming.
- A duality-bounds algorithm for non-convex quadratic programs with additional multiplicative constraints
- Outcome-space cutting-plane algorithm for linear multiplicative programming
- A unifying approach to solve some classes of rank-three multiplicative and fractional programs involving linear functions
- A survey of hidden convex optimization
- Underestimation functions for a rank-two partitioning method
- Bilevel multiplicative problems: A penalty approach to optimality and a cutting plane based algorithm
- A convex analysis approach for convex multiplicative programming
- Solving fractional problems with dynamic multistart improving hit-and-run
- Multiplicative programming problems: Analysis and efficient point search heuristic
- On linear multiplicative programming.
- An outcome space approach for generalized convex multiplicative programs
- A method of acceleration for a class of multiplicative programming problems with exponent
- A method based on parametric convex programming for solving convex multiplicative programming problem
- Data separation via a finite number of discriminant functions: a global optimization approach
- On the solution of generalized multiplicative extremum problems
- Approximation of linear fractional-multiplicative problems
- Solving a class of multiplicative programming problems via \(C\)- programming
- Outcome-space branch-and-bound outer approximation algorithm for a class of non-convex quadratic programming problems
- \(NP\)-hardness of linear multiplicative programming and related problems
- Branch-and-reduce algorithm for convex programs with additional multiplicative constraints
- Minimizing a linear multiplicative-type function under network flow constraints
- A robust solution approach for nonconvex quadratic programs with additional multiplicative constraints
- Level set algorithm for solving convex multiplicative programming problems
- Nonlinear separation of data via mixed 0-1 integer and linear programming
- Solving linear fractional bilevel programs.
- On a multiplicative hybrid problem
- Simplicial branch-and-reduce algorithm for convex programs with a multiplicative constraint
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)
