The complementary convex structure in global optimization
From MaRDI portal
Publication:1187368
DOI10.1007/BF00121300zbMath0787.90091OpenAlexW2082034788MaRDI QIDQ1187368
Publication date: 13 August 1992
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf00121300
complementary convex structuregeneralized rank \(k\) propertynonconvex nucleusspecially structured nonconvex global optimization
Nonlinear programming (90C30) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Linear programs with an additional rank two reverse convex constraint, Constraint decomposition algorithms in global optimization, Canonical d. c. programming techniques for solving a convex program with an additional constraint of multiplicative type, An outer approximation method for minimizing the product of several convex functions on a convex set, Minimizing the sum of a convex function and a specially structured nonconvex function, Strongly polynomial algorithm for a production-transportation problem with concave production cost, A continuous approch for globally solving linearly constrained quadratic, The minimum concave cost network flow problem with fixed numbers of sources and nonlinear arc costs, Strongly polynomial algorithm for two special minimum concave cost network flow problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quasiconjugates of functions, duality relationship between quasiconvex minimization under a reverse convex constraint and quasiconvex maximization under a convex constraint, and applications
- Convex programs with an additional reverse convex constraint
- On finding new vertices and redundant constraints in cutting plane algorithms for global optimization
- On the global minimization of a convex function under general nonconvex constraints
- Normal conical algorithm for concave minimization over polytopes
- Polyhedral annexation, dualization and dimension reduction technique in global optimization
- A parametric successive underestimation method for convex multiplicative programming problems
- A global optimization approach for the linear two-level program
- Linear multiplicative programming
- Approximation of solutions for location problems
- Computational Difficulties of Bilevel Linear Programming
- BOND PORTFOLIO OPTIMIZATION BY BILINEAR FRACTIONAL PROGRAMMING
- A cutting plane algorithm for solving bilinear programs
- An efficient solution method for rank two quasiconcave minimization problems
- A linear max—min problem
- A PARAMETRIC SUCCESSIVE UNDERESTIMATION METHOD FOR CONVEX PROGRAMMING PROBLEMS WITH AN ADDITIONAL CONVEX MULTIPLICATIVE CONSTRAINT
