Results 91 to 100 of about 231,170 (284)
Electronic Journal of Qualitative Theory of Differential EquationsIn this paper, we consider the existence of normalized solutions for the following Kirchhoff-type problem: \begin{equation*} -\left (a+b\int_{\mathbb{R}^{N}}|\nabla u|^{2}dx\right)\Delta u=\lambda u+|u|^{p-2}u+\mu |u|^{q-2}u\quad \mbox{in} \ \mathbb{R}^{
Changlin Liu, Ying Lv, Zeng-Qi Ou
doaj +1 more source
Suppression of Vibration Using Passive Receptance Method with Constrained Minimization
Shock and Vibration, 2008 Structural vibration analysis is used to suppress unwanted vibrations in many areas such as aerospace engineering, manufacturing, defense, automotive, etc.
Murat Tursun, Eşref Eşkinat
doaj +1 more source
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Objective To explore how cerebral hypoxia and Normal‐Appearing White Matter (NAWM) integrity affect MS lesion burden and clinical course. Methods Seventy‐nine MS patients, including 13 clinically isolated syndrome (CIS) patients and 66 relapsing–remitting multiple sclerosis (RRMS) patients, and 44 healthy controls (HCs) were recruited from ...
Xinli Wang +8 more
wiley +1 more source
A Systematic Comparison of Alpha‐Synuclein Seed Amplification Assays for Increasing Reproducibility
Annals of Clinical and Translational Neurology, EarlyView.ABSTRACT Seed amplification assays (SAAs) enable ultrasensitive detection of misfolded α‐synuclein across biofluids and tissues. Yet, heterogeneity in protocols limits cross‐study comparability and clinical translation. Here, we review α‐synuclein SAA methods and their performance across various biological matrices.
Manuela Amaral‐do‐Nascimento +3 more
wiley +1 more source
Relaxed Viscosity Approximation Methods with Regularization for Constrained Minimization Problems
Journal of Applied Mathematics, 2013 We introduce a new relaxed viscosity approximation method with regularization and prove the strong convergence of the method to a common fixed point of finitely many nonexpansive mappings and a strict pseudocontraction that also solves a convex ...
Lu-Chuan Ceng +2 more
doaj +1 more source
A New Nonconvex Sparse Recovery Method for Compressive Sensing
Frontiers in Applied Mathematics and Statistics, 2019 As an extension of the widely used ℓr-minimization with 0 < r ≤ 1, a new non-convex weighted ℓr − ℓ1 minimization method is proposed for compressive sensing.
Zhiyong Zhou, Jun Yu
doaj +1 more source
Constrained Minimization Problem for Image Restoration Based on Non-Convex Hybrid Regularization
IEEE Access, 2020 It is widely known that the classic total variation(TV) model has been proven to be very effective in preserving sharp edges. However, the TV model suffers from the staircase effects which produce blocking artifacts in the restored images. In this paper,
Jianguang Zhu +3 more
doaj +1 more source
Constrained Minimization Under Vector-Valued Criteria in Linear Topological Spaces [PDF]
Constrained minimization under vector valued criteria in linear topological ...
Da Cunha, N. O., Polak, E.
core +1 more source
A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion [PDF]
, 2013 We consider in this paper the problem of noisy 1-bit matrix completion under a general non-uniform sampling distribution using the max-norm as a convex relaxation for the rank. A max-norm constrained maximum likelihood estimate is introduced and studied.
Cai, T. Tony, Zhou, Wen-Xin
core +3 more sources
The Constrained Crossing Minimization Problem [PDF]
, 1999 In this paper we consider the constrained crossing minimization problem defined as follows. Given a connected planar graph G = (V,E), a combinatorial embedding II(G) of G, and a set of pairwise distinct edges F ⊆ V × V, find a drawing of G′ = (V,E ∼ F) such that the combinatorial embedding II(G) of G is preserved and the number of edge crossings is ...
Mutzel, P., Ziegler, T.
openaire +2 more sources