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

DOI10.1023/A:1026433520314MaRDI QIDQ5925721zbMATH OpenFDO

Authors R. Blanquero, Emilio Carrizosa

Publication date 19 February 2001

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

Full work available at URL https://idus.us.es/handle//11441/107713

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)

Recommendations

• scientific article; zbMATH DE number 6005913
• On the norm of a dc function
• Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function
• scientific article; zbMATH DE number 757676
• scientific article; zbMATH DE number 3950216

Cites work

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

Cited in

(7)

• Characterization and recognition of d.c. functions
• 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 of d.c. Functions in terms of quasidifferentials
• On the norm of a dc function
• On minimax-regret Huff location models

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5925721)