Sciweavers

JGO
2010
72views more  JGO 2010»
13 years 11 months ago
On numerical optimization theory of infinite kernel learning
S. Özögür-Akyüz, G.-W. Weber
JGO
2010
89views more  JGO 2010»
13 years 11 months ago
Iterative regularization algorithms for constrained image deblurring on graphics processors
Abstract The ability of the modern graphics processors to operate on large matrices in parallel can be exploited for solving constrained image deblurring problems in a short time. ...
Valeria Ruggiero, Thomas Serafini, Riccardo Zanell...
JGO
2010
119views more  JGO 2010»
13 years 11 months ago
Convergence rate for consensus with delays
Angelia Nedic, Asuman E. Ozdaglar
JGO
2010
117views more  JGO 2010»
13 years 11 months ago
Machine learning problems from optimization perspective
Both optimization and learning play important roles in a system for intelligent tasks. On one hand, we introduce three types of optimization tasks studied in the machine learning l...
Lei Xu
JGO
2010
121views more  JGO 2010»
13 years 11 months ago
The oracle penalty method
A new and universal penalty method is introduced in this contribution. It is especially intended to be applied in stochastic metaheuristics like genetic algorithms, particle swarm...
Martin Schlüter, Matthias Gerdts
JGO
2010
75views more  JGO 2010»
13 years 11 months ago
Optimal control of a quasi-variational obstacle problem
We consider an optimal control where the state-control relation is given by a quasi-variational inequality, namely a generalized obstacle problem. We give an existence result for s...
Samir Adly, Maïtine Bergounioux, Mohamed Ait ...
JGO
2010
115views more  JGO 2010»
13 years 11 months ago
Maximum flows and minimum cuts in the plane
A continuous maximum flow problem finds the largest t such that div v = t F(x, y) is possible with a capacity constraint (v1, v2) ≤ c(x, y). The dual problem finds a minimum ...
Gilbert Strang
JGO
2010
72views more  JGO 2010»
13 years 11 months ago
Strong convergence theorem by a hybrid extragradient-like approximation method for variational inequalities and fixed point prob
The purpose of this paper is to investigate the problem of finding a common element of the set of fixed points F(S) of a nonexpansive mapping S and the set of solutions ΩA of t...
Lu-Chuan Ceng, Nicolas Hadjisavvas, Ngai-Ching Won...
JGO
2010
531views more  JGO 2010»
13 years 11 months ago
Characterizing zero-derivative points
We study smooth functions in several variables with a Lipschitz derivative. It is shown that these functions have the “envelope property”: Around zero-derivative points, and on...
Sanjo Zlobec
JGO
2010
69views more  JGO 2010»
13 years 11 months ago
Solving the problem of packing equal and unequal circles in a circular container
In this paper we propose a Monotonic Basin Hopping approach and its population-based variant Population Basin Hopping to solve the problem of packing equal and unequal circles wit...
Andrea Grosso, A. R. M. J. U. Jamali, Marco Locate...