In this paper, we present a nonmonotone smoothing Newton algorithm for solving the circular cone programming(CCP) problem in which a linear function is minimized or maximized over the intersection of an affine space w...In this paper, we present a nonmonotone smoothing Newton algorithm for solving the circular cone programming(CCP) problem in which a linear function is minimized or maximized over the intersection of an affine space with the circular cone. Based on the relationship between the circular cone and the second-order cone(SOC), we reformulate the CCP problem as the second-order cone problem(SOCP). By extending the nonmonotone line search for unconstrained optimization to the CCP, a nonmonotone smoothing Newton method is proposed for solving the CCP. Under suitable assumptions, the proposed algorithm is shown to be globally and locally quadratically convergent. Some preliminary numerical results indicate the effectiveness of the proposed algorithm for solving the CCP.展开更多
In this paper, we combine the nonmonotone and adaptive techniques with trust region method for unconstrained minimization problems. We set a new ratio of the actual descent and predicted descent. Then, instead of the ...In this paper, we combine the nonmonotone and adaptive techniques with trust region method for unconstrained minimization problems. We set a new ratio of the actual descent and predicted descent. Then, instead of the monotone sequence, the nonmonotone sequence of function values are employed. With the adaptive technique, the radius of trust region △k can be adjusted automatically to improve the efficiency of trust region methods. By means of the Bunch-Parlett factorization, we construct a method with indefinite dogleg path for solving the trust region subproblem which can handle the indefinite approximate Hessian Bk. The convergence properties of the algorithm are established. Finally, detailed numerical results are reported to show that our algorithm is efficient.展开更多
In this paper, we propose a modified trust-region filter method algorithm for Minimax problems, which based on the framework of SQP-filter method and associated with the technique of nonmonotone method. We use the SQP...In this paper, we propose a modified trust-region filter method algorithm for Minimax problems, which based on the framework of SQP-filter method and associated with the technique of nonmonotone method. We use the SQP subproblem to acquire an attempt step, and use the filter to weigh the effect of the attempt step so as to avoid using penalty function. The algorithm uses the Lagrange function as a merit function and the nonmonotone filter to improve the effect of the algorithm. Under some mild conditions, we prove the global convergence.展开更多
The trust region method plays an important role in solving optimization problems. In this paper, we propose a new nonmonotone adaptive trust region method for solving unconstrained optimization problems. Actually, we ...The trust region method plays an important role in solving optimization problems. In this paper, we propose a new nonmonotone adaptive trust region method for solving unconstrained optimization problems. Actually, we combine a popular nonmonotone technique with an adaptive trust region algorithm. The new ratio to adjusting the next trust region radius is different from the ratio in the traditional trust region methods. Under some appropriate conditions, we show that the new algorithm has good global convergence and superlinear convergence.展开更多
In this paper we present a nonmonotone trust region method for nonlinear least squares problems with zero-residual and prove its convergence properties. The extensive numerical results are reported which show that the...In this paper we present a nonmonotone trust region method for nonlinear least squares problems with zero-residual and prove its convergence properties. The extensive numerical results are reported which show that the nonmonotone trust region method is generally superior to the usual trust region method.展开更多
We study a new class of elliptic variational-hemivariational inequalities arising in the modelling of contact problems for elastic ideally locking materials. The contact is described by the Signorini unilateral contac...We study a new class of elliptic variational-hemivariational inequalities arising in the modelling of contact problems for elastic ideally locking materials. The contact is described by the Signorini unilateral contact condition and the friction is modelled by the nonmonotone multivalued subdifferential condition which depends on the slip. The problem is governed by a nonlinear elasticity operator, the subdifferential of the indicator function of a convex set which describes the locking constraints and a nonconvex locally Lipschitz friction potential. The result on existence and uniqueness of solution to the inequality is shown. The proof is based on a surjectivity result for maximal monotone and pseudomonotone operators combined with the application of the Banach contraction principle.展开更多
The paper presents the formulation and approximation of a static thermoelasticity problem that describes bilateral frictional contact between a deformable body and a rigid foundation. The friction is in the form of a ...The paper presents the formulation and approximation of a static thermoelasticity problem that describes bilateral frictional contact between a deformable body and a rigid foundation. The friction is in the form of a nonmonotone and multivalued law. The coupling effect of the problem is neglected. Therefore, the thermic part of the problem is considered independently on the elasticity problem. For the displacement vector, we formulate one substationary problem for a non-convex, locally Lipschitz continuous functional representing the total potential energy of the body. All problems formulated in the paper are approximated with the finite element method.展开更多
A reaction-diffusion model for a single species with age structure and nonlocal reaction for periodic time t is derived. Some results about the model with monotone birth function are firstly introduced, and then by co...A reaction-diffusion model for a single species with age structure and nonlocal reaction for periodic time t is derived. Some results about the model with monotone birth function are firstly introduced, and then by constructing two auxiliary equations and squeezing method, the spreading speed for the system with nonmonotone birth function is obtained.展开更多
This paper discusses the global convergence of a class of nonmonotone conjugate gra- dient methods(NM methods) for nonconvex object functions.This class of methods includes the nonmonotone counterpart of modified Po...This paper discusses the global convergence of a class of nonmonotone conjugate gra- dient methods(NM methods) for nonconvex object functions.This class of methods includes the nonmonotone counterpart of modified Polak- Ribière method and modified Hestenes- Stiefel method as special cases展开更多
In this paper, we provide and analyze a new scaled conjugate gradient method and its performance, based on the modified secant equation of the Broyden-Fletcher-Goldfarb-Shanno (BFGS) method and on a new modified nonmo...In this paper, we provide and analyze a new scaled conjugate gradient method and its performance, based on the modified secant equation of the Broyden-Fletcher-Goldfarb-Shanno (BFGS) method and on a new modified nonmonotone line search technique. The method incorporates the modified BFGS secant equation in an effort to include the second order information of the objective function. The new secant equation has both gradient and function value information, and its update formula inherits the positive definiteness of Hessian approximation for general convex function. In order to improve the likelihood of finding a global optimal solution, we introduce a new modified nonmonotone line search technique. It is shown that, for nonsmooth convex problems, the proposed algorithm is globally convergent. Numerical results show that this new scaled conjugate gradient algorithm is promising and efficient for solving not only convex but also some large scale nonsmooth nonconvex problems in the sense of the Dolan-Moré performance profiles.展开更多
In this paper, we propose a new method which based on the nonmonotone line search technique for solving symmetric nonlinear equations. The method can ensure that the search direction is descent for the norm function. ...In this paper, we propose a new method which based on the nonmonotone line search technique for solving symmetric nonlinear equations. The method can ensure that the search direction is descent for the norm function. Under suitable conditions, the global convergence of the method is proved. Numerical results show that the presented method is practicable for the test problems.展开更多
The study focuses on the imputation for the longitudinal survey data which often has nonignorable nonrespondents. Local linear regression is used to impute the missing values and then the estimation of the time-depend...The study focuses on the imputation for the longitudinal survey data which often has nonignorable nonrespondents. Local linear regression is used to impute the missing values and then the estimation of the time-dependent finite populations means. The asymptotic properties (unbiasedness and consistency) of the proposed estimator are investigated. Comparisons between different parametric and nonparametric estimators are performed based on the bootstrap standard deviation, mean square error and percentage relative bias. A simulation study is carried out to determine the best performing estimator of the time-dependent finite population means. The simulation results show that local linear regression estimator yields good properties.展开更多
In this paper, an alternating direction nonmonotone approximate Newton algorithm (ADNAN) based on nonmonotone line search is developed for solving inverse problems. It is shown that ADNAN converges to a solution of th...In this paper, an alternating direction nonmonotone approximate Newton algorithm (ADNAN) based on nonmonotone line search is developed for solving inverse problems. It is shown that ADNAN converges to a solution of the inverse problems and numerical results provide the effectiveness of the proposed algorithm.展开更多
In the paper, a new mixed algorithm combined with schemes of nonmonotone line search, the systems of linear equations for higher order modification and sequential quadratic programming for constrained optimizations is...In the paper, a new mixed algorithm combined with schemes of nonmonotone line search, the systems of linear equations for higher order modification and sequential quadratic programming for constrained optimizations is presented. Under some weaker assumptions,without strict complementary condition, the algorithm is globally and superlinearly convergent.展开更多
In this paper,by designing a normalized nonmonotone search strategy with the BarzilaiBorwein-type step-size,a novel local minimax method(LMM),which is a globally convergent iterative method,is proposed and analyzed to...In this paper,by designing a normalized nonmonotone search strategy with the BarzilaiBorwein-type step-size,a novel local minimax method(LMM),which is a globally convergent iterative method,is proposed and analyzed to find multiple(unstable)saddle points of nonconvex functionals in Hilbert spaces.Compared to traditional LMMs with monotone search strategies,this approach,which does not require strict decrease of the objective functional value at each iterative step,is observed to converge faster with less computations.Firstly,based on a normalized iterative scheme coupled with a local peak selection that pulls the iterative point back onto the solution submanifold,by generalizing the Zhang-Hager(ZH)search strategy in the optimization theory to the LMM framework,a kind of normalized ZH-type nonmonotone step-size search strategy is introduced,and then a novel nonmonotone LMM is constructed.Its feasibility and global convergence results are rigorously carried out under the relaxation of the monotonicity for the functional at the iterative sequences.Secondly,in order to speed up the convergence of the nonmonotone LMM,a globally convergent Barzilai-Borwein-type LMM(GBBLMM)is presented by explicitly constructing the Barzilai-Borwein-type step-size as a trial step-size of the normalized ZH-type nonmonotone step-size search strategy in each iteration.Finally,the GBBLMM algorithm is implemented to find multiple unstable solutions of two classes of semilinear elliptic boundary value problems with variational structures:one is the semilinear elliptic equations with the homogeneous Dirichlet boundary condition and another is the linear elliptic equations with semilinear Neumann boundary conditions.Extensive numerical results indicate that our approach is very effective and speeds up the LMMs significantly.展开更多
In this paper, an unconstrained optimization method using the nonmonotone second order Goldstein's line search is proposed. By using the negative curvature information from the Hessian,the sequence generated is sh...In this paper, an unconstrained optimization method using the nonmonotone second order Goldstein's line search is proposed. By using the negative curvature information from the Hessian,the sequence generated is shown to converge to a stationary point with the second order optimality conditions. Numerical tests on a set of standard test problems confirm the efficiency of our new method.展开更多
A trust region algorithm for equality constrained optimization is proposed, which is a nonmonotone one in a certain sense. The augmented Lagrangian function is used as a merit function. Under certain conditions, the g...A trust region algorithm for equality constrained optimization is proposed, which is a nonmonotone one in a certain sense. The augmented Lagrangian function is used as a merit function. Under certain conditions, the global convergence theorems of the algorithm are proved.展开更多
In this paper, a nonmonotone method based on McCormick's second-order Armijo's step-size rule [7] for unconstrained optimization problems is proposed. Every limit point of the sequence generated by using this proced...In this paper, a nonmonotone method based on McCormick's second-order Armijo's step-size rule [7] for unconstrained optimization problems is proposed. Every limit point of the sequence generated by using this procedure is proved to be a stationary point with the second-order optimality conditions. Numerical tests on a set of standard test problems are presented and show that the new algorithm is efficient and robust.展开更多
A class of nonmonotone trust region algorithms is presented for unconstrained optimizations. Under suitable conditions, the global and Q quadratic convergences of the algorithm are proved. Several rules of choosing tr...A class of nonmonotone trust region algorithms is presented for unconstrained optimizations. Under suitable conditions, the global and Q quadratic convergences of the algorithm are proved. Several rules of choosing trial steps and trust region radii are also discussed.展开更多
基金supported by the National Natural Science Foundation of China(11401126,71471140 and 11361018)Guangxi Natural Science Foundation(2016GXNSFBA380102 and 2014GXNSFFA118001)+2 种基金Guangxi Key Laboratory of Cryptography and Information Security(GCIS201618)Guangxi Key Laboratory of Automatic Detecting Technology and Instruments(YQ15112 and YQ16112)China
文摘In this paper, we present a nonmonotone smoothing Newton algorithm for solving the circular cone programming(CCP) problem in which a linear function is minimized or maximized over the intersection of an affine space with the circular cone. Based on the relationship between the circular cone and the second-order cone(SOC), we reformulate the CCP problem as the second-order cone problem(SOCP). By extending the nonmonotone line search for unconstrained optimization to the CCP, a nonmonotone smoothing Newton method is proposed for solving the CCP. Under suitable assumptions, the proposed algorithm is shown to be globally and locally quadratically convergent. Some preliminary numerical results indicate the effectiveness of the proposed algorithm for solving the CCP.
基金Supported by the NNSF(10231060 and 10501024)of Chinathe Specialized Research Fund(20040319003)of Doctoral Program of Higher Education of China+1 种基金the Natural Science Grant(BK2006214)of Jiangsu Province of Chinathe Foundation(2004NXY20)of Nanjing Xiaozhuang College.
文摘In this paper, we combine the nonmonotone and adaptive techniques with trust region method for unconstrained minimization problems. We set a new ratio of the actual descent and predicted descent. Then, instead of the monotone sequence, the nonmonotone sequence of function values are employed. With the adaptive technique, the radius of trust region △k can be adjusted automatically to improve the efficiency of trust region methods. By means of the Bunch-Parlett factorization, we construct a method with indefinite dogleg path for solving the trust region subproblem which can handle the indefinite approximate Hessian Bk. The convergence properties of the algorithm are established. Finally, detailed numerical results are reported to show that our algorithm is efficient.
文摘In this paper, we propose a modified trust-region filter method algorithm for Minimax problems, which based on the framework of SQP-filter method and associated with the technique of nonmonotone method. We use the SQP subproblem to acquire an attempt step, and use the filter to weigh the effect of the attempt step so as to avoid using penalty function. The algorithm uses the Lagrange function as a merit function and the nonmonotone filter to improve the effect of the algorithm. Under some mild conditions, we prove the global convergence.
文摘The trust region method plays an important role in solving optimization problems. In this paper, we propose a new nonmonotone adaptive trust region method for solving unconstrained optimization problems. Actually, we combine a popular nonmonotone technique with an adaptive trust region algorithm. The new ratio to adjusting the next trust region radius is different from the ratio in the traditional trust region methods. Under some appropriate conditions, we show that the new algorithm has good global convergence and superlinear convergence.
基金State Major Key Project for Basic ResearchesDecision Making and Information System Laboratory+1 种基金 Academy of Science of China Natural Science Foundation of Tsinghua University.
文摘In this paper we present a nonmonotone trust region method for nonlinear least squares problems with zero-residual and prove its convergence properties. The extensive numerical results are reported which show that the nonmonotone trust region method is generally superior to the usual trust region method.
基金supported by the National Science Center of Poland under the Maestro 3 Project No.DEC-2012/06/A/ST1/00262the project Polonium“Mathematical and Numerical Analysis for Contact Problems with Friction”2014/15 between the Jagiellonian University and Universitde Perpignan Via Domitia
文摘We study a new class of elliptic variational-hemivariational inequalities arising in the modelling of contact problems for elastic ideally locking materials. The contact is described by the Signorini unilateral contact condition and the friction is modelled by the nonmonotone multivalued subdifferential condition which depends on the slip. The problem is governed by a nonlinear elasticity operator, the subdifferential of the indicator function of a convex set which describes the locking constraints and a nonconvex locally Lipschitz friction potential. The result on existence and uniqueness of solution to the inequality is shown. The proof is based on a surjectivity result for maximal monotone and pseudomonotone operators combined with the application of the Banach contraction principle.
基金supported by the Minisitry of Science of the Republic of Serbia (No. 144005)
文摘The paper presents the formulation and approximation of a static thermoelasticity problem that describes bilateral frictional contact between a deformable body and a rigid foundation. The friction is in the form of a nonmonotone and multivalued law. The coupling effect of the problem is neglected. Therefore, the thermic part of the problem is considered independently on the elasticity problem. For the displacement vector, we formulate one substationary problem for a non-convex, locally Lipschitz continuous functional representing the total potential energy of the body. All problems formulated in the paper are approximated with the finite element method.
基金Supported by the NSF of China(11171120)Supported by the Doctoral Program of Higher Education of China(20094407110001)Supported by the NSF of Guangdong Province(10151063101000003)
文摘A reaction-diffusion model for a single species with age structure and nonlocal reaction for periodic time t is derived. Some results about the model with monotone birth function are firstly introduced, and then by constructing two auxiliary equations and squeezing method, the spreading speed for the system with nonmonotone birth function is obtained.
基金Supported by the National Natural Science Foundation of China(1 0 1 6 1 0 0 2 ) and Guangxi Natural Sci-ence Foundation (0 1 3 5 0 0 4 )
文摘This paper discusses the global convergence of a class of nonmonotone conjugate gra- dient methods(NM methods) for nonconvex object functions.This class of methods includes the nonmonotone counterpart of modified Polak- Ribière method and modified Hestenes- Stiefel method as special cases
文摘In this paper, we provide and analyze a new scaled conjugate gradient method and its performance, based on the modified secant equation of the Broyden-Fletcher-Goldfarb-Shanno (BFGS) method and on a new modified nonmonotone line search technique. The method incorporates the modified BFGS secant equation in an effort to include the second order information of the objective function. The new secant equation has both gradient and function value information, and its update formula inherits the positive definiteness of Hessian approximation for general convex function. In order to improve the likelihood of finding a global optimal solution, we introduce a new modified nonmonotone line search technique. It is shown that, for nonsmooth convex problems, the proposed algorithm is globally convergent. Numerical results show that this new scaled conjugate gradient algorithm is promising and efficient for solving not only convex but also some large scale nonsmooth nonconvex problems in the sense of the Dolan-Moré performance profiles.
文摘In this paper, we propose a new method which based on the nonmonotone line search technique for solving symmetric nonlinear equations. The method can ensure that the search direction is descent for the norm function. Under suitable conditions, the global convergence of the method is proved. Numerical results show that the presented method is practicable for the test problems.
文摘The study focuses on the imputation for the longitudinal survey data which often has nonignorable nonrespondents. Local linear regression is used to impute the missing values and then the estimation of the time-dependent finite populations means. The asymptotic properties (unbiasedness and consistency) of the proposed estimator are investigated. Comparisons between different parametric and nonparametric estimators are performed based on the bootstrap standard deviation, mean square error and percentage relative bias. A simulation study is carried out to determine the best performing estimator of the time-dependent finite population means. The simulation results show that local linear regression estimator yields good properties.
文摘In this paper, an alternating direction nonmonotone approximate Newton algorithm (ADNAN) based on nonmonotone line search is developed for solving inverse problems. It is shown that ADNAN converges to a solution of the inverse problems and numerical results provide the effectiveness of the proposed algorithm.
文摘In the paper, a new mixed algorithm combined with schemes of nonmonotone line search, the systems of linear equations for higher order modification and sequential quadratic programming for constrained optimizations is presented. Under some weaker assumptions,without strict complementary condition, the algorithm is globally and superlinearly convergent.
基金supported by the NSFC(Grant Nos.12171148,11771138)the NSFC(Grant Nos.12101252,11971007)+2 种基金the NSFC(Grant No.11901185)the National Key R&D Program of China(Grant No.2021YFA1001300)by the Fundamental Research Funds for the Central Universities(Grant No.531118010207).
文摘In this paper,by designing a normalized nonmonotone search strategy with the BarzilaiBorwein-type step-size,a novel local minimax method(LMM),which is a globally convergent iterative method,is proposed and analyzed to find multiple(unstable)saddle points of nonconvex functionals in Hilbert spaces.Compared to traditional LMMs with monotone search strategies,this approach,which does not require strict decrease of the objective functional value at each iterative step,is observed to converge faster with less computations.Firstly,based on a normalized iterative scheme coupled with a local peak selection that pulls the iterative point back onto the solution submanifold,by generalizing the Zhang-Hager(ZH)search strategy in the optimization theory to the LMM framework,a kind of normalized ZH-type nonmonotone step-size search strategy is introduced,and then a novel nonmonotone LMM is constructed.Its feasibility and global convergence results are rigorously carried out under the relaxation of the monotonicity for the functional at the iterative sequences.Secondly,in order to speed up the convergence of the nonmonotone LMM,a globally convergent Barzilai-Borwein-type LMM(GBBLMM)is presented by explicitly constructing the Barzilai-Borwein-type step-size as a trial step-size of the normalized ZH-type nonmonotone step-size search strategy in each iteration.Finally,the GBBLMM algorithm is implemented to find multiple unstable solutions of two classes of semilinear elliptic boundary value problems with variational structures:one is the semilinear elliptic equations with the homogeneous Dirichlet boundary condition and another is the linear elliptic equations with semilinear Neumann boundary conditions.Extensive numerical results indicate that our approach is very effective and speeds up the LMMs significantly.
基金This work was supported by the National Natural Science Foundation of China(Grant No.10231060)the Specialized Research Fund of Doctoral Program of Higher Education of China(Grant No.20040319003)
文摘In this paper, an unconstrained optimization method using the nonmonotone second order Goldstein's line search is proposed. By using the negative curvature information from the Hessian,the sequence generated is shown to converge to a stationary point with the second order optimality conditions. Numerical tests on a set of standard test problems confirm the efficiency of our new method.
基金Project supported by the National Natural Science Foundation of China and Postdoctoral Foundation of China.
文摘A trust region algorithm for equality constrained optimization is proposed, which is a nonmonotone one in a certain sense. The augmented Lagrangian function is used as a merit function. Under certain conditions, the global convergence theorems of the algorithm are proved.
基金supported by the National Natural Science Foundation of China(grant No.10231060)the Specialized Research Fund of Doctoral Program of Higher Education of China at No.20040319003the Graduates'Creative Project of Jiangsu Province,China.
文摘In this paper, a nonmonotone method based on McCormick's second-order Armijo's step-size rule [7] for unconstrained optimization problems is proposed. Every limit point of the sequence generated by using this procedure is proved to be a stationary point with the second-order optimality conditions. Numerical tests on a set of standard test problems are presented and show that the new algorithm is efficient and robust.
文摘A class of nonmonotone trust region algorithms is presented for unconstrained optimizations. Under suitable conditions, the global and Q quadratic convergences of the algorithm are proved. Several rules of choosing trial steps and trust region radii are also discussed.