Optimization on low rank nonconvex structures

zbMath0879.90171MaRDI QIDQ1353375

Hoang Tuy, Hiroshi Konno, Phan Thien Thach

Publication date: 29 April 1997

Published in: Nonconvex Optimization and Its Applications (Search for Journal in Brave)

zbMATH Keywords

global optimization; d.c. programming; duality; nonconvex optimization; design centering; dynamic programming algorithms; continuous location problems; nonconvexity index; nonconvexity rank; optimal balls; quasi-subdifferentials

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90C90: Applications of mathematical programming

90B85: Continuous location

90C26: Nonconvex programming, global optimization

90C29: Multi-objective and goal programming

90C30: Nonlinear programming

49J52: Nonsmooth analysis

90C32: Fractional programming

90B30: Production models

90B05: Inventory, storage, reservoirs

90-02: Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming

Related Items

Inner approximation method for a reverse convex programming problem, An inner approximation method incorporating a branch and bound procedure for optimization over the weakly efficient set, An inner approximation method incorporating with a penalty function method for a reverse convex programming problem, A branch and reduce approach for solving a class of low rank d.c. programs, Outer approximation method incorporating a quadratic approximation for a DC programming problem, Global maximization of a generalized concave multiplicative function, An efficient algorithm for solving convex-convex quadratic fractional programs, \(\alpha \)-conservative approximation for probabilistically constrained convex programs, Solving a large scale semi-definite logit model, Theoretical and algorithmic results for a class of hierarchical fleet mix problems, A note on composite concave quadratic programming, Simplicially-constrained DC optimization over efficient and weakly efficient sets, Bounds for global optimization of capacity expansion and flow assignment problems, Recent developments and trends in global optimization, The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems, A branch and bound algorithm for solving a class of D-C programming, Solving a class of multiplicative programs with 0-1 knapsack constraints, Global optimization of a rank-two nonconvex program, Global optimization for the sum of generalized polynomial fractional functions, A novel approach to bilevel nonlinear programming, 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, Mean-variance portfolio optimal problem under concave transaction cost, \(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, Solving sum-of-ratios fractional programs using efficient points, Global optimization for robust control synthesis based on the Matrix Product Eigenvalue Problem, A continuous approch for globally solving linearly constrained quadratic, Separable convexification and DCA techniques for capacity and flow assignment problems, Unnamed Item