Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1531961
- Solving Molecular Distance Geometry Problems Using a Continuous Optimization Approach
- DC programming approaches for distance geometry problems
- scientific article; zbMATH DE number 1488003
- Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming
Cited in
(54)- Portfolio selection under downside risk measures and cardinality constraints based on DC programming and DCA
- DC programming and DCA for globally solving the value-at-risk
- A geometric buildup algorithm for the solution of the distance geometry problem using least-squares approximation
- Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming
- Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model
- A continuous DC programming approach for resource allocation in OFDMA/TDD wireless networks
- Convergence analysis of difference-of-convex algorithm with subanalytic data
- DC programming and DCA: thirty years of developments
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA
- A branch-and-bound algorithm embedded with DCA for DC programming
- Portfolio optimization model with and without options under additional constraints
- Robust Euclidean embedding via EDM optimization
- Globally convergent DC trust-region methods
- Variations and extension of the convex-concave procedure
- A new efficient algorithm based on DC programming and DCA for clustering
- Application of lower bound direct method to engineering structures
- Binary classification via spherical separator by DC programming and DCA
- A continuous approach for the concave cost supply problem via DC programming and DCA
- A continuous DC programming approach to the strategic supply chain design problem from qualified partner set
- Optimization based DC programming and DCA for hierarchical clustering
- Euclidean distance matrices and applications
- DC programming approaches for distance geometry problems
- DCA based algorithms for multiple sequence alignment (MSA)
- Molecular distance geometry methods: from continuous to discrete
- DC approximation approaches for sparse optimization
- DC programming and DCA for general DC programs
- DC Programming Approaches for BMI and QMI Feasibility Problems
- A DC programming approach for planning a multisensor multizone search for a target
- Molecular embedding via a second order dissimilarity parameterized approach
- Single Straddle Carrier Routing Problem in Port Container Terminals: Mathematical Model and Solving Approaches
- Hyperbolic smoothing and penalty techniques applied to molecular structure determination
- An efficient DC programming approach for portfolio decision with higher moments
- Exact penalty and error bounds in DC programming
- A DC programming approach for solving the symmetric eigenvalue complementarity problem
- scientific article; zbMATH DE number 1101492 (Why is no real title available?)
- scientific article; zbMATH DE number 1488003 (Why is no real title available?)
- scientific article; zbMATH DE number 1531961 (Why is no real title available?)
- DC programming and DCA for challenging problems in bioinformatics and computational biology
- Maxent-stress optimization of 3D biomolecular models
- On the computation of protein backbones by using artificial backbones of hydrogens
- Stochastic difference-of-convex-functions algorithms for nonconvex programming
- DC programming approaches for discrete portfolio optimization under concave transaction costs
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
- A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems
- On solving difference of convex functions programs with linear complementarity constraints
- A variable metric and Nesterov extrapolated proximal DCA with backtracking for a composite DC program
- Properties of two DC algorithms in quadratic programming
- Least-squares approximations in geometric buildup for solving distance geometry problems
- Globally solving a nonlinear UAV task assignment problem by stochastic and deterministic optimization approaches
- The discretizable molecular distance geometry problem
- DC programming techniques for solving a class of nonlinear bilevel programs
- Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms
- Extending the geometric build-up algorithm for the molecular distance geometry problem
This page was built for publication: Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4441949)
