DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology (Q4983006)

scientific article; zbMATH DE number 6424678

Language	Label	Description	Also known as
English	DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology	scientific article; zbMATH DE number 6424678

Statements

instance of

scholarly article

0 references

title

DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology (English)

0 references

zbMATH Open document ID

1309.90079

0 references

DOI

10.1007/978-3-319-09039-9_17

0 references

author

Hoai An Le Thi

0 references

published in

Automata, Universality, Computation

0 references

publication date

14 April 2015

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-09039-9_17

0 references

OpenAlex ID

W139057721

0 references

cites work

A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems

0 references

New formulations of the multiple sequence alignment problem

0 references

Lower energy icosahedral atomic clusters with incomplete core

0 references

A genetic algorithm for Lennard-Jones atomic clusters

0 references

Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem

0 references

Q5818996

0 references

Constrained 0-1 quadratic programming: basic approaches and extensions

0 references

Compact vs. exponential-size LP relaxations

0 references

Q5461825

0 references

Q2756586

0 references

Approximate energy minimization for large Lennard-Jones clusters

0 references

Integer Quadratic Programming Models in Computational Biology

0 references

Algorithms on Strings, Trees and Sequences

0 references

Q3141900

0 references

Equivalent formulations and necessary optimality conditions for the Lennard-Jones problem

0 references

An Algorithm for Global Minimization of Linearly Constrained Concave Quadratic Functions

0 references

Q4003678

0 references

A polyhedral approach to sequence alignment problems

0 references

DC Programming and DCA for General DC Programs

0 references

Numerical solution for optimization over the efficient set by d.c. optimization algorithms

0 references

Q4514007

0 references

A continuous approch for globally solving linearly constrained quadratic

0 references

Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach

0 references

Solving large scale molecular distance geometry problems by a smoothing technique via the Gaussian transform and D.C. programming

0 references

The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems

0 references

DC Programming Approaches for Distance Geometry Problems

0 references

DCA based algorithms for multiple sequence alignment (MSA)

0 references

Efficient algorithms for large scale global optimization: Lennard-Jones clusters

0 references

Computational aspects of a branch and bound algorithm for quadratic zero- one programming

0 references

Convex analysis approach to d. c. programming: Theory, algorithms and applications

0 references

A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem

0 references

An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs

0 references

Efficient algorithms for local alignment search

0 references

Convex Analysis

0 references

Q4210893

0 references

Minimum inter-particle distance at global minimizers of Lennard-Jones clusters

0 references

Q3137900

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:4983006