Visualizing data as objects by DC (difference of convex) optimization
From MaRDI portal
Publication:1749447
DOI10.1007/s10107-017-1156-1zbMath1390.90616OpenAlexW2609480752MaRDI QIDQ1749447
Vanesa Guerrero, Dolores Romero Morales, Emilio Carrizosa
Publication date: 16 May 2018
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://research-api.cbs.dk/ws/files/57275370/dolores_romero_morales_visualizing_data_as_objects_acceptedversion.pdf
Related Items (9)
Mathematical optimization in classification and regression trees ⋮ Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints ⋮ Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach ⋮ Optimal randomized classification trees ⋮ On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps ⋮ On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions ⋮ On mathematical optimization for clustering categories in contingency tables ⋮ Comments on: ``Distance geometry and data science ⋮ A unified Douglas-Rachford algorithm for generalized DC programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A second-order method for strongly convex \(\ell _1\)-regularization problems
- \(rs\)-sparse principal component analysis: a mixed integer nonlinear programming approach with VNS
- Supervised classification and mathematical optimization
- Biobjective sparse principal component analysis
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- Approximate formulas of average distances associated with regions and their applications to location problems
- Theory of semidefinite programming for sensor network localization
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- General variable neighborhood search for the continuous optimization
- Continuous location problems and big triangle small triangle: Constructing better bounds
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- Location and shape of a rectangular facility in \(\mathbb{R}^n\). Convexity properties
- The Weber problem with regional demand
- Cluster analysis and mathematical programming
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Continuous location of dimensional structures.
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach
- Gaussian variable neighborhood search for continuous optimization
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Extensions of classical multidimensional scaling via variable reduction
- Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
- Performance of first- and second-order methods for \(\ell_1\)-regularized least squares problems
- A discussion of scalarization techniques for multiple objective integer programming
- Operations research and data mining
- A clustering search metaheuristic for the point-feature cartographic label placement problem
- Modern multidimensional scaling. Theory and applications.
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- DC Programming Approaches for Distance Geometry Problems
- On the Selection of the Globally Optimal Prototype Subset for Nearest-Neighbor Classification
- Locating Objects in the Plane Using Global Optimization Techniques
- Solving the irregular strip packing problem via guided local search for overlap minimization
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- Finding Groups in Data
- The generalized Weber problem with expected distances
- Euclidean Distance Geometry and Applications
- Second‐Order Cone Programming Relaxation of Sensor Network Localization
- Some distance properties of latent root and vector methods used in multivariate analysis
- Convex analysis and global optimization
This page was built for publication: Visualizing data as objects by DC (difference of convex) optimization
