Optimization on low rank nonconvex structures
From MaRDI portal
Publication:1353375
zbMath0879.90171MaRDI QIDQ1353375
Hiroshi Konno, Phan Thien Thach, Hoang Tuy
Publication date: 29 April 1997
Published in: Nonconvex Optimization and Its Applications (Search for Journal in Brave)
global optimizationd.c. programmingdualitynonconvex optimizationdesign centeringdynamic programming algorithmscontinuous location problemsnonconvexity indexnonconvexity rankoptimal ballsquasi-subdifferentials
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Continuous location (90B85) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29) Nonlinear programming (90C30) Nonsmooth analysis (49J52) Fractional programming (90C32) Production models (90B30) Inventory, storage, reservoirs (90B05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Optimizing over the properly efficient set of convex multi-objective optimization problems, A simplicial branch and bound duality-bounds algorithm to linear multiplicative programming, Global optimization of a rank-two nonconvex program, Outer approximation method incorporating a quadratic approximation for a DC programming problem, An efficient algorithm for computing a class of multiplicative optimization problem, Global optimization algorithm for sum of generalized polynomial ratios problem, Global optimization algorithm for solving linear multiplicative programming problems, An FPTAS for optimizing a class of low-rank functions over a polytope, A general purpose exact solution method for mixed integer concave minimization problems, An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint, On second order cone programming approach to two-stage network data envelopment analysis, Dual and bidual problems for a Lipschitz optimization problem based on quasi-conjugation, An outcome space algorithm for optimization over the weakly efficient set of a multiple objective nonlinear programming problem, Simplicially-constrained DC optimization over efficient and weakly efficient sets, Improvements by analyzing the efficient frontier in DEA, Global optimization for a class of nonlinear sum of ratios problem, Preconditioned ADMM for a class of bilinear programming problems, Global optimization for generalized linear multiplicative programming using convex relaxation, Global maximization of a generalized concave multiplicative function, Solving a class of multiplicative programs with 0-1 knapsack constraints, Solving DC programs using the cutting angle method, Global optimization for the sum of generalized polynomial fractional functions, A novel approach to bilevel nonlinear programming, An efficient algorithm for solving convex-convex quadratic fractional programs, Unnamed Item, Solving sum-of-ratios fractional programs using efficient points, Range division and compression algorithm for quadratically constrained sum of quadratic ratios, Linear decomposition approach for a class of nonconvex programming problems, Inner approximation method for a reverse convex programming problem, Global optimization for robust control synthesis based on the Matrix Product Eigenvalue Problem, A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems, Minimization of the ratio of functions defined as sums of the absolute values, Constant rebalanced portfolio optimization under nonlinear transaction costs, An inner approximation method incorporating with a penalty function method for a reverse convex programming problem, \(\alpha \)-conservative approximation for probabilistically constrained convex programs, Solving a large scale semi-definite logit model, A continuous approch for globally solving linearly constrained quadratic, A new algorithm for concave quadratic programming, Mean-variance portfolio optimal problem under concave transaction cost, Separable convexification and DCA techniques for capacity and flow assignment problems, The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems, An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set, A branch and bound algorithm for solving a class of D-C programming, Underestimation functions for a rank-two partitioning method, Global optimization algorithm for a generalized linear multiplicative programming, An out space accelerating algorithm for generalized affine multiplicative programs problem, A branch and reduce approach for solving a class of low rank d.c. programs, A new polynomially solvable class of quadratic optimization problems with box constraints, Theoretical and algorithmic results for a class of hierarchical fleet mix problems, \(NP\)-hardness of linear multiplicative programming and related problems, Optimization of a long-short portfolio under nonconvex transaction cost, Robust solution of nonconvex global optimization problems, Bounds for global optimization of capacity expansion and flow assignment problems, A note on composite concave quadratic programming, Recent developments and trends in global optimization
