Pages that link to "Item:Q1430176"

The following pages link to Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming (Q1430176):

Displayed 15 items.

• An efficient DC programming approach for portfolio decision with higher moments (Q409263) ‎ (← links)
• The discretizable molecular distance geometry problem (Q694593) ‎ (← links)
• Extending the geometric build-up algorithm for the molecular distance geometry problem (Q975461) ‎ (← links)
• An application of a global optimization parametrization method on macromolecular structure problem (Q990575) ‎ (← links)
• Recent advances on the interval distance geometry problem (Q1683318) ‎ (← links)
• DC programming and DCA: thirty years of developments (Q1749443) ‎ (← links)
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems (Q1772961) ‎ (← links)
• Alternating DCA for reduced-rank multitask linear regression with covariance matrix estimation (Q2163851) ‎ (← links)
• A Euclidean distance matrix model for protein molecular conformation (Q2307747) ‎ (← links)
• Variations and extension of the convex-concave procedure (Q2358020) ‎ (← links)
• Molecular distance geometry methods: from continuous to discrete (Q3087839) ‎ (← links)
• DC Programming Approaches for BMI and QMI Feasibility Problems (Q3192953) ‎ (← links)
• DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology (Q4983006) ‎ (← links)
• (Q5111761) ‎ (← links)
• A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems (Q6155061) ‎ (← links)