Dominating Sets for Convex Functions with Some Applications
Open Access
- 1 February 1998
- journal article
- Published by Springer Science and Business Media LLC in Journal of Optimization Theory and Applications
- Vol. 96 (2), 281-295
- https://doi.org/10.1023/a:1022614029984
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- An Elementary Rate of Convergence Proof for the Deep Cut Ellipsoid AlgorithmPublished by World Scientific Pub Co Pte Ltd ,1995
- A deep cut ellipsoid algorithm for convex programming: Theory and applicationsMathematical Programming, 1994
- Convex Analysis and Minimization Algorithms IGrundlehren der mathematischen Wissenschaften, 1993
- Global OptimizationPublished by Springer Science and Business Media LLC ,1993
- Optima and EquilibriaGraduate Texts in Mathematics, 1993
- The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithmJournal of Optimization Theory and Applications, 1988
- Nondifferentiable Optimization: Motivations and ApplicationsPublished by Springer Science and Business Media LLC ,1985
- Localization in single facility locationEuropean Journal of Operational Research, 1984
- Perfect duality for convexlike programsJournal of Optimization Theory and Applications, 1982
- Location Theory, Dominance, and ConvexityOperations Research, 1973