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

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

Emilio Carrizosa, Rafael Blanquero

Publication date: 19 February 2001

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

zbMATH Keywords

difference of convex functions; global optimization; location theory; multiple-criteria decision making

Mathematics Subject Classification ID

90B85: Continuous location

90C26: Nonconvex programming, global optimization

90C29: Multi-objective and goal programming

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.