A filling function method for unconstrained global optimization.
- Published in:
- Computational Optimization & Applications, 2015, v. 61, n. 3, p. 713, doi. 10.1007/s10589-015-9728-6
- By:
- Publication type:
- Article
Works in Computational Optimization & Applications, 2015, Vol 61, Issue 3
Results: 10
1
2
A collision detection approach for maximizing the material utilization.
- Published in:
- Computational Optimization & Applications, 2015, v. 61, n. 3, p. 761, doi. 10.1007/s10589-015-9729-5
- By:
- Publication type:
- Article
3
Convergence results for the discrete regularization of linear-quadratic control problems with bang-bang solutions.
- Published in:
- Computational Optimization & Applications, 2015, v. 61, n. 3, p. 731, doi. 10.1007/s10589-015-9730-z
- By:
- Publication type:
- Article
4
Unifying semidefinite and set-copositive relaxations of binary problems and randomization techniques.
- Published in:
- Computational Optimization & Applications, 2015, v. 61, n. 3, p. 669, doi. 10.1007/s10589-015-9731-y
- By:
- Publication type:
- Article
5
Path following in the exact penalty method of convex programming.
- Published in:
- Computational Optimization & Applications, 2015, v. 61, n. 3, p. 609, doi. 10.1007/s10589-015-9732-x
- By:
- Publication type:
- Article
6
Using an outward selective pressure for improving the search quality of the MOEA/D algorithm.
- Published in:
- Computational Optimization & Applications, 2015, v. 61, n. 3, p. 571, doi. 10.1007/s10589-015-9733-9
- By:
- Publication type:
- Article
7
Sparsity preserving preconditioners for linear systems in interior-point methods.
- Published in:
- Computational Optimization & Applications, 2015, v. 61, n. 3, p. 557, doi. 10.1007/s10589-015-9735-7
- By:
- Publication type:
- Article
8
An alternating direction method with increasing penalty for stable principal component pursuit.
- Published in:
- Computational Optimization & Applications, 2015, v. 61, n. 3, p. 635, doi. 10.1007/s10589-015-9736-6
- By:
- Publication type:
- Article
9
A finite hyperplane traversal Algorithm for 1-dimensional $$L^1pTV$$ minimization, for $$0<p\le 1$$.
- Published in:
- Computational Optimization & Applications, 2015, v. 61, n. 3, p. 783, doi. 10.1007/s10589-015-9738-4
- By:
- Publication type:
- Article
10
Potential induced random teleportation on finite graphs.
- Published in:
- Computational Optimization & Applications, 2015, v. 61, n. 3, p. 689, doi. 10.1007/s10589-015-9727-7
- By:
- Publication type:
- Article