Dominating sets for convex functions with some applications

DOI10.1023/A:1022614029984zbMath0905.90134MaRDI QIDQ1389077

J. B. G. Frenk, Emilio Carrizosa

Publication date: 14 September 1998

Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)

zbMATH Keywords

convexitylocationlinear regressiondominating sets

Mathematics Subject Classification ID

Convex programming (90C25) Continuous location (90B85)

Related Items (26)

An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification ⋮ On \(q\)-steepest descent method for unconstrained multiobjective optimization problems ⋮ An external penalty-type method for multicriteria ⋮ Barzilai and Borwein's method for multiobjective optimization problems ⋮ Inexact projected gradient method for vector optimization ⋮ A penalty decomposition approach for multi-objective cardinality-constrained optimization problems ⋮ An adaptive nonmonotone line search for multiobjective optimization problems ⋮ Strictly feasible solutions and strict complementarity in multiple objective linear optimization ⋮ Pareto front approximation through a multi-objective augmented Lagrangian method ⋮ Multiobjective BFGS method for optimization on Riemannian manifolds ⋮ Multiobjective conjugate gradient methods on Riemannian manifolds ⋮ A memetic procedure for global multi-objective optimization ⋮ A limited memory quasi-Newton approach for multi-objective optimization ⋮ A barrier-type method for multiobjective optimization ⋮ A steepest descent method for vector optimization ⋮ Planar multifacility location problems with tree structure and finite dominating sets ⋮ Convergence of the projected gradient method for quasiconvex multiobjective optimization ⋮ Cardinality-Constrained Multi-objective Optimization: Novel Optimality Conditions and Algorithms ⋮ An away-step Frank-Wolfe algorithm for constrained multiobjective optimization ⋮ Accelerated nonmonotone line search technique for multiobjective optimization ⋮ Two adaptive nonmonotone trust-region algorithms for solving multiobjective optimization problems ⋮ Scaled-PAKKT sequential optimality condition for multiobjective problems and its application to an augmented Lagrangian method ⋮ On \(q\)-Newton's method for unconstrained multiobjective optimization problems ⋮ On the convergence of the projected gradient method for vector optimization ⋮ An augmented Lagrangian algorithm for multi-objective optimization ⋮ A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Localization in single facility location
• Geometrical properties of the Fermat-Weber problem
• Sets of efficient points in a normed space
• Solving general continuous single facility location problems by cutting planes
• The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
• Perfect duality for convexlike programs
• Hull properties in location problems
• GBSSS: The generalized big square small square method for planar single- facility location
• A deep cut ellipsoid algorithm for convex programming: Theory and applications
• Quasiconvex optimization and location theory
• Pareto-optimality in linear regression
• El conjunto eficiente en problemas de localizacion con normas mixtas (L p)
• The Minisum and Minimax Location Problems Revisited
• Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
• State Constraints in Convex Control Problems of Bolza
• Location Theory, Dominance, and Convexity

This page was built for publication: Dominating sets for convex functions with some applications