نتایج جستجو برای: prox regular functions

تعداد نتایج: 605810  

Journal: :SIAM Journal on Optimization 2008
D. Russell Luke

We study the convergence of an iterative projection/reflection algorithm originally proposed for solving what are known as phase retrieval problems in optics. There are two features that frustrate any analysis of iterative methods for solving the phase retrieval problem: nonconvexity and infeasibility. The algorithm that we developed, called Relaxed Averaged Alternating Reflections (RAAR), was ...

2012
A. Abakarov M. Nuñez

Please cite this article in press as: Abakarov, A., (2012), doi:10.1016/j.jfoodeng.2012.02.013 The algorithms and graphic user interface software package ‘‘OPT-PROx’’ are developed to meet food engineering needs related to canned food thermal processing simulation and optimization. The adaptive random search algorithm and its modification coupled with penalty function’s approach, and the finite...

2009
Frédéric Bernicot Juliette Venel

This paper is devoted to weaken “classical” assumptions and give new arguments to prove existence of sweeping process (associated to the proximal normal cone of sets). Mainly we define the concept of a “directional prox-regularity” and give assumptions about a Banach space to insure the existence of such sweeping process (which permit to generalize the existing results requiring a Hilbertian st...

Journal: :Annals of vascular surgery 2005
Karl A Illig Scott Surowiec Cynthia K Shortell Mark G Davies Jeffrey M Rhodes Richard M Green

Distal revascularization-interval ligation (DRIL) empirically corrects steal after arteriovenous fistula (AVF) creation in most cases, but because there is no topologic alteration in anatomy, it is unclear as to why it is effective. To explore this issue, nine symptomatic patients underwent intravascular pressure and flow measurements before and after DRIL following upper arm autologous AVFs. M...

2018
Damek Davis Dmitriy Drusvyatskiy

We consider an algorithm that successively samples and minimizes stochastic models of the objective function. We show that under weak-convexity and Lipschitz conditions, the algorithm drives the expected norm of the gradient of the Moreau envelope to zero at the rate O(k−1/4). Our result yields the first complexity guarantees for the stochastic proximal point algorithm on weakly convex problems...

2001
M. M. Schubert T. P. Häring G. Bräth H. A. Gasteiger R. J. Behm

A new design for a DRIFTS cell for in-situ studies in heterogeneous catalysis is presented, which allows for improved reaction control (i.e., gas flow, temperature, minimized background conversion) and for precise kinetic measurements. Specifically, the very low background activity of the cell itself for CO and H2 oxidation makes it possible to study the preferential CO oxidation in H2-rich gas...

Journal: :Mechanisms of development 1993
G Oliver B Sosa-Pineda S Geisendorf E P Spana C Q Doe P Gruss

Prox 1, a likely mouse homologue of the Drosophila homeobox gene prospero has been cloned and its expression pattern analyzed during development. In Drosophila, prospero is expressed in the developing CNS, lens-secreting cone cells of the eye, and midgut. In the mouse, Prox 1 is expressed in many of the same tissues: young neurons of the subventricular region of the CNS, developing eye lens and...

2009
Shu-Kai Hsieh Chun-Han Chang Ivy Kuo Hintat Cheung Chu-Ren Huang Bruno Gaume

Modeling of semantic space is a new and challenging research topic both in cognitive science and linguistics. Existing approaches can be classified into two different types according to how the calculation are done: either a word-by-word co-occurrence matrix or a word-by-context matrix (Riordan 2007). In this paper, we argue that the existing popular distributional semantic model (vector space ...

2010
ALEXANDER D. IOFFE

Let/be a locally Lipschitz function on a Banach space X, and S a subset of X. We define regular (i.e. noncritical) points for / relative to S, and give a sufficient condition for a point z e S to be regular. This condition is then expressed in the particular case when/is C1, and is used to obtain a new proof of Hoffman's inequality in linear programming.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید