Visualizing data as objects by DC (difference of convex) optimization
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 1795206 (Why is no real title available?)
- scientific article; zbMATH DE number 847265 (Why is no real title available?)
- (Robust) edge-based semidefinite programming relaxation of sensor network localization
- A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
- A clustering search metaheuristic for the point-feature cartographic label placement problem
- A discussion of scalarization techniques for multiple objective integer programming
- A new approach for sheet nesting problem using guided cuckoo search and pairwise clustering
- A second-order method for strongly convex \(\ell _1\)-regularization problems
- An efficient algorithm for globally minimizing a quadratic function under convex quadratic constraints
- Approximate formulas of average distances associated with regions and their applications to location problems
- Biobjective sparse principal component analysis
- Cluster analysis and mathematical programming
- Continuous location of dimensional structures.
- Continuous location problems and big triangle small triangle: Constructing better bounds
- Convex analysis and global optimization
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC programming approaches for distance geometry problems
- Euclidean distance geometry and applications
- Extensions of classical multidimensional scaling via variable reduction
- Finding Groups in Data
- Further Relaxations of the Semidefinite Programming Approach to Sensor Network Localization
- Gaussian variable neighborhood search for continuous optimization
- General variable neighborhood search for the continuous optimization
- Improving the efficiency of DC global optimization methods by improving the DC representation of the objective function
- Locating Objects in the Plane Using Global Optimization Techniques
- Location and shape of a rectangular facility in \(\mathbb{R}^n\). Convexity properties
- Modern multidimensional scaling. Theory and applications.
- Multidimensional scaling by optimizing goodness of fit to a nonmetric hypothesis
- New and old bounds for standard quadratic optimization: dominance, equivalence and incomparability
- On the selection of the globally optimal prototype subset for nearest-neighbor classification
- Operations research and data mining
- Performance of first- and second-order methods for _1-regularized least squares problems
- Second‐Order Cone Programming Relaxation of Sensor Network Localization
- Solving the irregular strip packing problem via guided local search for overlap minimization
- Some distance properties of latent root and vector methods used in multivariate analysis
- Supervised classification and mathematical optimization
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- The Weber problem with regional demand
- The generalized Weber problem with expected distances
- Theory of semidefinite programming for sensor network localization
- Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach
- rs-sparse principal component analysis: a mixed integer nonlinear programming approach with VNS
Cited in
(13)- Mathematical optimization in classification and regression trees
- On mathematical optimization for clustering categories in contingency tables
- A unified Douglas-Rachford algorithm for generalized DC programming
- Optimal randomized classification trees
- Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
- Comments on: ``Distance geometry and data science
- On Fenchel c -conjugate dual problems for DC optimization: characterizing weak, strong and stable strong duality
- Visualizing proportions and dissimilarities by space-filling maps: a large neighborhood search approach
- Self-organizing maps by difference of convex functions optimization
- Lagrange duality on DC evenly convex optimization problems via a generalized conjugation scheme
- On subdifferentials via a generalized conjugation scheme: an application to DC problems and optimality conditions
- On mathematical optimization for the visualization of frequencies and adjacencies as rectangular maps
- scientific article; zbMATH DE number 1795206 (Why is no real title available?)
This page was built for publication: Visualizing data as objects by DC (difference of convex) optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1749447)
