Dominating sets for convex functions with some applications
From MaRDI portal
Publication:1389077
DOI10.1023/A:1022614029984zbMATH Open0905.90134MaRDI QIDQ1389077FDOQ1389077
Authors: J. B. G. Frenk, Emilio Carrizosa 
Publication date: 14 September 1998
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Recommendations
Cites Work
- A deep cut ellipsoid algorithm for convex programming: Theory and applications
- Title not available (Why is that?)
- Solving general continuous single facility location problems by cutting planes
- The Minisum and Minimax Location Problems Revisited
- State Constraints in Convex Control Problems of Bolza
- GBSSS: The generalized big square small square method for planar single- facility location
- Location Theory, Dominance, and Convexity
- Geometrical properties of the Fermat-Weber problem
- Perfect duality for convexlike programs
- Title not available (Why is that?)
- Quasiconvex optimization and location theory
- Hull properties in location problems
- Technical Note—Location Theory, Dominance, and Convexity: Some Further Results
- Localization in single facility location
- Sets of efficient points in a normed space
- El conjunto eficiente en problemas de localizacion con normas mixtas (L p)
- The minimization of lower subdifferentiable functions under nonlinear constraints: An all feasible cutting plane algorithm
- Pareto-optimality in linear regression
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (29)
- On \(q\)-steepest descent method for unconstrained multiobjective optimization problems
- An away-step Frank-Wolfe algorithm for constrained multiobjective optimization
- An FPT-algorithm for modifying a graph of bounded treewidth to decrease the size of its dominating set using minimum modification
- Multiobjective BFGS method for optimization on Riemannian manifolds
- Barzilai and Borwein's method for multiobjective optimization problems
- Accelerated nonmonotone line search technique for multiobjective optimization
- An adaptive nonmonotone line search for multiobjective optimization problems
- An external penalty-type method for multicriteria
- Two adaptive nonmonotone trust-region algorithms for solving multiobjective optimization problems
- On dominating sets for uniform algebra on pseudoconvex domains
- Convergence of the projected gradient method for quasiconvex multiobjective optimization
- A barrier-type method for multiobjective optimization
- On \(q\)-Newton's method for unconstrained multiobjective optimization problems
- Scaled-PAKKT sequential optimality condition for multiobjective problems and its application to an augmented Lagrangian method
- A steepest descent method for vector optimization
- Planar multifacility location problems with tree structure and finite dominating sets
- Dominated extensions of functionals and V-convex functions of cancellative cones
- Strictly feasible solutions and strict complementarity in multiple objective linear optimization
- Title not available (Why is that?)
- A superlinearly convergent nonmonotone quasi-Newton method for unconstrained multiobjective optimization
- Cardinality-Constrained Multi-objective Optimization: Novel Optimality Conditions and Algorithms
- An augmented Lagrangian algorithm for multi-objective optimization
- Pareto front approximation through a multi-objective augmented Lagrangian method
- A memetic procedure for global multi-objective optimization
- Inexact projected gradient method for vector optimization
- Multiobjective conjugate gradient methods on Riemannian manifolds
- A limited memory quasi-Newton approach for multi-objective optimization
- A penalty decomposition approach for multi-objective cardinality-constrained optimization problems
- On the convergence of the projected gradient method for vector optimization
This page was built for publication: Dominating sets for convex functions with some applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1389077)
