Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
From MaRDI portal
Publication:4441949
DOI10.1137/S1052623498342794zbMath1075.90071MaRDI QIDQ4441949
Publication date: 19 January 2004
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
reformulationsLagrangian dualitydistance geometry problemd.c.\ algorithm (DCA)d.c.\ programmingdissimilarity geometry problemsubdifferential calculations
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30)
Related Items
Variations and extension of the convex-concave procedure, DC programming techniques for solving a class of nonlinear bilevel programs, DCA based algorithms for multiple sequence alignment (MSA), DC approximation approaches for sparse optimization, Difference of convex functions algorithms (DCA) for image restoration via a Markov random field model, A new efficient algorithm based on DC programming and DCA for clustering, Application of lower bound direct method to engineering structures, 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, A DC programming approach for planning a multisensor multizone search for a target, A continuous DC programming approach for resource allocation in OFDMA/TDD wireless networks, DC Programming and DCA for General DC Programs, DC Programming Approaches for BMI and QMI Feasibility Problems, Binary classification via spherical separator by DC programming and DCA, An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs, Solving the minimum M-dominating set problem by a continuous optimization approach based on DC programming and DCA, Feature selection for linear SVMs under uncertain data: robust optimization based on difference of convex functions algorithms, Hyperbolic smoothing and penalty techniques applied to molecular structure determination, An efficient DC programming approach for portfolio decision with higher moments, A numerical-and-computational study on the impact of using quaternions in the branch-and-prune algorithm for exact discretizable distance geometry problems, Properties of two DC algorithms in quadratic programming, 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, Exact penalty and error bounds in DC programming, A DC programming approach for solving the symmetric eigenvalue complementarity problem, Least-squares approximations in geometric buildup for solving distance geometry problems, 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, Convergence analysis of difference-of-convex algorithm with subanalytic data, DC programming and DCA: thirty years of developments, A continuous approach for the concave cost supply problem via DC programming and DCA, Globally convergent DC trust-region methods, Globally solving a nonlinear UAV task assignment problem by stochastic and deterministic optimization approaches, The discretizable molecular distance geometry problem, On the computation of protein backbones by using artificial backbones of hydrogens, Extending the geometric build-up algorithm for the molecular distance geometry problem, The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems, DC programming approaches for discrete portfolio optimization under concave transaction costs, Euclidean Distance Matrices and Applications, Unnamed Item, Single Straddle Carrier Routing Problem in Port Container Terminals: Mathematical Model and Solving Approaches, Molecular distance geometry methods: from continuous to discrete, DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology, 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, Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming
