检索结果-南通市图书馆

同方期刊数据库

A Regularization semismooth newton method for P_(0)-NCPs with a Non-monotone Line Search

在线全文

学校读者我要写书评

暂无评论

Numerical Mathematics(Theory,methods and Applications) 2012年第2期5卷 186-204页

作者： Li-Yong Lu Wei-Zhe Gu Wei Wang Department of Mathematics School of ScienceTianjin University of TechnologyTianjin 300384China Department of Mathematics School of ScienceTianjin UniversityTianjin 300072China School of Public Administration Tianjin University of CommerceTianjin 300134China

In this paper,we propose a regularized version of the generalized NCPfunction proposed by Hu,Huang and Chen[***.,230(2009),pp.69–82].Based on this regularized function,we propose a semismooth newton method for solving nonlinear complementarity problems,where a non-monotone line search scheme is *** particular,we show that the proposed non-monotone method is globally and locally superlinearly convergent under suitable *** test the proposed method by solving the test problems from *** experiments indicate that this algorithm has better numerical performance in the case of p=5 andθ∈[0.25,075]than other cases.

关键词： Nonlinear complementarity problem non-monotone line search semismooth newton method global convergence local superlinear convergence

Regularization semismooth newton method for P_0-NCPs with Non-monotone Line Search

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Transactions of Tianjin University 2010年第2期16卷 138-141页

作者：王萍臧玉卫张颖 School of Sciences Tianjin University Tianjin University Beiyang Science and Technology Development Co. Ltd.

Based on the generalized Fischer-Burmeister function, Chen et al in 2008 put forward a regularization semismooth newton method for solving the nonlinear complementarity problem with a P0-function. In this paper, we investigate the above algorithm with the monotone line search replaced by a non-monotone line search. It is shown that the non-monotone algorithm is well-defined, and is globally and locally superlinearly convergent under standard assumptions.

关键词： nonlinearity complementarity semismooth newton method Fischer-Burrneister function

A Monotone semismooth newton method for a Kind of Tensor Complementarity Problem

在线全文

学校读者我要写书评

暂无评论

Advances in Pure Mathematics 2021年第4期11卷 369-376页

作者： Shuilian Xie School of Mathematics Jiaying University Meizhou Guangdong China

Tensor complementarity problem (TCP) is a special kind of nonlinear complementarity problem (NCP). In this paper, we introduce a new class of structure tensor and give some examples. By transforming the TCP to the system of nonsmooth equations, we develop a semismooth newton method for the tensor complementarity problem. We prove the monotone convergence theorem for the proposed method under proper conditions.

关键词： Tensor Complementarity Problem M-Like Tensor semismooth newton method Monotone Convergence

Total Variation Based Parameter-Free Model for Impulse Noise Removal

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Numerical Mathematics(Theory,methods and Applications) 2017年第1期10卷 186-204页

作者： Federica Sciacchitano Yiqiu Dong Martin S.Andersen Department of Applied Mathematics and Computer Science Technical University of Denmark2800 Kgs.LyngbyDenmark

We propose a new two-phase method for reconstruction of blurred im-ages corrupted by impulse *** the first phase,we use a noise detector to iden-tify the pixels that are contaminated by noise,and then,in the second phase,we reconstruct the noisy pixels by solving an equality constrained total variation mini-mization problem that preserves the exact values of the noise-free *** images that are only corrupted by impulse noise(i.e.,not blurred)we apply the semismooth newton’s method to a reduced problem,and if the images are also blurred,we solve the equality constrained reconstruction problem using a first-order primal-dual *** proposed model improves the computational efficiency(in the denoising case)and has the advantage of being regularization *** numerical results suggest that the method is competitive in terms of its restoration capabilities with respect to the other two-phase methods.

关键词： Image deblurring image denoising impulse noise noise detector primal-dual first-order algorithm semismooth newton method total variation regularization

Fast projection onto the ordered weighted ℓ_(1) norm ball

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Science China Mathematics 2022年第4期65卷 869-886页

作者： Qinzhen Li Xudong Li School of Data Science Fudan UniversityShanghai200433China Shanghai Center for Mathematical Sciences Fudan UniversityShanghai200433China

In this paper,we provide a finitely terminated yet efficient approach to compute the Euclidean projection onto the ordered weightedℓ_(1)(OWL1)norm *** particular,an efficient semismooth newton method is proposed for solving the dual of a reformulation of the original projection *** and local quadratic convergence results,as well as the finite termination property,of the algorithm are *** comparisons with the two best-known methods demonstrate the efficiency of our *** addition,we derive the generalized Jacobian of the studied projector which,we believe,is crucial for the future designing of fast second-order nonsmooth methods for solving general OWL1 norm constrained problems.

关键词： Euclidean projector ordered weightedℓ_(1)norm ball HS-Jacobian semismooth newton method

An Inverse Source Problem with Sparsity Constraint for the Time-Fractional Diffusion Equation

在线全文

学校读者我要写书评

暂无评论

Advances in Applied Mathematics and Mechanics 2016年第1期8卷 1-18页

作者： Zhousheng Ruan Zhijian Yang Xiliang Lu School of Mathematics and Statistics Wuhan UniversityWuhan 430072China School of Science East China Institute of TechnologyNanchang 330013China

In this paper,an inverse source problem for the time-fractional diffusion equation is *** observational data is on the final time and the source term is assumed to be temporally independent and with a sparse *** the sparsity is understood with respect to the pixel basis,i.e.,the source has a small *** an elastic-net regularization method,this inverse source problem is formulated into an optimization problem and a semismooth newton(SSN)algorithm is developed to solve it.A discretization strategy is applied in the numerical *** one and two dimensional numerical examples illustrate the efficiency of the proposed method.

关键词： Inverse source problem time-fractional diffusion equation sparse constraint elasticnet regularization method semismooth newton method

Conditional Quadratic Semidefinite Programming:Examples and methods

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of the Operations Research Society of China 2014年第2期2卷 143-170页

作者： Hou-Duo Qi School of Mathematics The University of SouthamptonHighfieldSouthampton SO171BJUK

The conditional quadratic semidefinite programming(cQSDP)refers to a class of matrix optimization problems whose matrix variables are required to be positive semidefinite on a subspace,and the objectives are *** chief purpose of this paper is to focus on two primal examples of cQSDP:the problem of matrix completion/approximation on a subspace and the Euclidean distance matrix *** the latter problem,we review some classical contributions and establish certain links among ***,we develop a semismooth newton method for a special class of cQSDP and establish its quadratic convergence under the condition of constraint *** also include an application in calibrating the correlation matrix in Libor market *** hope this work will stimulate new research in cQSDP.

关键词： Matrix optimization Conditional semidefinite programming Euclidean distance matrix semismooth newton method

A Penalty Approach for Generalized Nash Equilibrium Problem

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Communications in Mathematical Research 2012年第2期28卷 181-192页

作者： Hou JIAN LAI JUN-FENG School of Mathematical Sciences Dalian University of Technology Dalian Liaoning 116024 Science College Inner Mongolia University of Technology Hohhot 010051

The generalized Nash equilibrium problem （GNEP） is a generalization of the standard Nash equilibrium problem （NEP）, in which both the utility function and the strategy space of each player depend on the strategies chosen by all other players. This problem has been used to model various problems in applications. However, the convergent solution algorithms are extremely scare in the literature. In this paper, we present an incremental penalty method for the GNEP, and show that a solution of the GNEP can be found by solving a sequence of smooth NEPs. We then apply the semismooth newton method with Armijo line search to solve latter problems and provide some results of numerical experiments to illustrate the proposed approach.

关键词： Nash equilibrium problem generalized Nash equilibrium problem log-arithmic barrier function quasi-variational inequality semismooth newton method

Proximal methods for Elliptic Optimal Control Problems with Sparsity Cost Functional

在线全文

学校读者我要写书评

暂无评论

Applied Mathematics 2016年第9期7卷 967-992页

作者： Andreas Schindele Alfio Borzì Institut für Mathematik Universit?t Würzburg Würzburg Germany

First-order proximal methods that solve linear and bilinear elliptic optimal control problems with a sparsity cost functional are discussed. In particular, fast convergence of these methods is proved. For benchmarking purposes, inexact proximal schemes are compared to an inexact semismooth newton method. Results of numerical experiments are presented to demonstrate the computational effectiveness of proximal schemes applied to infinite-dimensional elliptic optimal control problems and to validate the theoretical estimates.

关键词： Optimal Control Elliptic PDE Nonsmooth Optimization Proximal method semismooth newton method