Optimization of the norm of a vector-valued DC function and applications

DOI10.1023/A:1026433520314zbMath1064.90034MaRDI QIDQ5925721

Rafael Blanquero, Emilio Carrizosa

Publication date: 19 February 2001

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

zbMATH Keywords

difference of convex functionsglobal optimizationlocation theorymultiple-criteria decision making

Mathematics Subject Classification ID

Continuous location (90B85) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)

Related Items (7)

A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning ⋮ Solving the median problem with continuous demand on a network ⋮ Locating a competitive facility in the plane with a robustness criterion ⋮ Characterization and recognition of d.c. functions ⋮ Characterization of d.c. Functions in terms of quasidifferentials ⋮ On the norm of a dc function ⋮ On minimax-regret Huff location models

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On functions representable as a difference of convex functions
• Multiple criteria decision making, 22nd International Meeting of TIMS, July 24--26, 1975, Kyoto/Japan
• DC programming: overview.
• Nonlinear goal programming theory and practice: A survey
• Some representation theorems for functions and sets and their application to nonlinear programming
• A partitioning gradient based (PGB) algorithm for solving nonlinear goal programming problems
• The rectilinear distance minisum problem with minimum distance constraints:
• Technical Note—Algorithms for Weber Facility Location in the Presence of Forbidden Regions and/or Barriers to Travel
• Convex Analysis
• Convex analysis and global optimization
• On covering method for d.c. optimization.

This page was built for publication: Optimization of the norm of a vector-valued DC function and applications