A new smoothing nonlinear conjugate gradient method for nonsmooth equations with finitely many maximum functions (Q370203): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1155/2013/780107 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2105335319 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On almost smooth functions and piecewise smooth functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-Dimensional Variational Inequalities and Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton and Quasi-Newton Methods for a Class of Nonsmooth Equations and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Newton methods for solving two classes of nonsmooth equations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parametrized Newton method for nonsmooth equations with finitely many maximum functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modified Newton methods for solving a semismooth reformulation of monotone complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonsmooth version of Newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using vector divisions in solving the linear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing Nonlinear Conjugate Gradient Method for Image Restoration Using Nonsmooth Nonconvex Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing methods for nonsmooth, nonconvex minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complementarity: applications, algorithms and extensions. Papers from the international conference on complementarity (ICCP 99), Madison, WI, USA, June 9--12, 1999 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nonlinear Conjugate Gradient Method with a Strong Global Convergence Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence of a modified Hestenes-Stiefel nonlinear conjugate gradient method with Armijo line search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Further insight into the Shamanskii modification of Newton method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear conjugate gradient methods with Wolfe type line search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A modified conjugate gradient algorithm with cyclic Barzilai-Borwein steplength for unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxation scheme for Hamilton-Jacobi-Bellman equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Engineering and Economic Applications of Complementarity Problems / rank
 
Normal rank

Latest revision as of 22:05, 6 July 2024

scientific article
Language Label Description Also known as
English
A new smoothing nonlinear conjugate gradient method for nonsmooth equations with finitely many maximum functions
scientific article

    Statements

    A new smoothing nonlinear conjugate gradient method for nonsmooth equations with finitely many maximum functions (English)
    0 references
    0 references
    0 references
    0 references
    19 September 2013
    0 references
    Summary: The nonlinear conjugate gradient method is of particular importance for solving unconstrained optimization. Finitely many maximum functions are a kind of very useful nonsmooth equations, which is very useful in the study of complementarity problems, constrained nonlinear programming problems, and many problems in engineering and mechanics. Smoothing methods for solving nonsmooth equations, complementarity problems, and stochastic complementarity problems have been studied for decades. In this paper, we present a new smoothing nonlinear conjugate gradient method for nonsmooth equations with finitely many maximum functions. The new method also guarantees that any accumulation point of the iterative points sequence, which is generated by the new method, is a Clarke stationary point of the merit function for nonsmooth equations with finitely many maximum functions.
    0 references
    0 references
    nonlinear conjugate gradient method
    0 references
    nonsmooth equation
    0 references
    Clarke stationary point
    0 references
    0 references
    0 references