Results 31 to 40 of about 38,046 (312)
Deblurring by Solving a TVp-Regularized Optimization Problem Using Split Bregman Method
Advances in Multimedia, 2014 Image deblurring is formulated as an unconstrained minimization problem, and its penalty function is the sum of the error term and TVp-regularizers with ...
Su Xiao
doaj +1 more source
Discrete Dynamics in Nature and Society, 2015 We study a system of 2-coupled nonlinear fractional Schrödinger equations. Firstly, we construct constrained minimization problem to the system. Next, we prove the existence of standing waves for the system by using the concentration-compactness and ...
Xiuyan Sha, Huanmin Ge, Jie Xin
doaj +1 more source
SVD as a preconditioner in nonlinear optimization
Computer Assisted Methods in Engineering and Science, 2017 Finding a solution of nonlinear constrained optimization problem may be very computer resources consuming, regardless of solution method adopted. A conceptually simple preconditioning procedure, based on singular value decomposition (SVD), is proposed ...
Michał Pazdanowski
doaj +1 more source
An efficient approach to constrained via minimization for two-layer VLSI routing
, 1999 Constrained Via Minimization is the problem of reassigning wire segments of a VLSI routing so that the number of vias is minimized. In this paper, a new approach is proposed for two-layer VLSI routing. This approach is able to handle any types of routing,
Hon Nin Cheung +5 more
core +1 more source
Bounded perturbation resilience of the viscosity algorithm
Journal of Inequalities and Applications, 2016 In this article, we investigate the bounded perturbation resilience of the viscosity algorithm and propose the superiorized version of the viscosity algorithm. The convergence of the proposed algorithm is analyzed for a nonexpansive mapping.
Qiao-Li Dong, Jing Zhao, Songnian He
doaj +1 more source
Existence of normalized solutions for the nonlinear Schrödinger–Poisson–Boltzmann system
Electronic Journal of Qualitative Theory of Differential EquationsIn this paper, we consider the following nonlinear Schrödinger–Poisson–Boltzmann (SPB) system under an $L^2$-norm constraint \begin{equation*} \begin{cases} -\Delta u+\lambda u+\phi u=\left|u\right|^{p-2}u&\text{in}\ \mathbb{R}^3,\\ -\Delta \phi+\kappa ...
Ruisha Chang, Kaimin Teng, Lintao Liu
doaj +1 more source
Weak and Strong Superiorization: Between Feasibility-Seeking and Minimization
Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica, 2015 We review the superiorization methodology, which can be thought of, in some cases, as lying between feasibility-seeking and constrained minimization. It is not quite trying to solve the full edged constrained minimization problem; rather, the task is to ...
Censor Yair
doaj +1 more source
Resolving the constrained minimal and next-to-minimal supersymmetric standard models [PDF]
Physical Review D, 1995 76 pages, latex, no macros, uuencoded figures included separately. This version (to appear in Phys. Rev.
King, S. F., White, P. L.
openaire +3 more sources
A practical and efficient approach to the constrained via minimization problem
, 2001 This paper presents an efficient and practical approach to the Constrained Via Minimization (CVM) problem, which assigns wire segments to the layers, using the minimum number of vias, given a feasible partial routing.
Hock-Chuan Chua +5 more
core +1 more source
Linearly Constrained Nonsmooth and Nonconvex Minimization [PDF]
SIAM Journal on Optimization, 2013 Motivated by variational models in continuum mechanics, we introduce a novel algorithm to perform nonsmooth and nonconvex minimizations with linear constraints in Euclidean spaces. We show how this algorithm is actually a natural generalization of the well-known non-stationary augmented Lagrangian method for convex optimization.
Marco Artina +2 more
openaire +4 more sources