Sciweavers

    5 search results - page 1 / 1
    » Superlinearly Convergent Algorithms for Solving Singular Equ...
    Sort
    View
    SIAMJO
    2002
    115views more  SIAMJO 2002»
    Superlinearly Convergent Algorithms for Solving Singular Equations and Smooth Reformulations of Complementarity Problems
    13 years 4 months ago
    Superlinearly Convergent Algorithms for Solving Singular Equations and Smooth Reformulations of Complementarity Problems
    Download  pages.cs.wisc.edu
    We propose a new algorithm for solving smooth nonlinear equations in the case where their solutions can be singular. Compared to other techniques for computing singular solutions, ...
    Alexey F. Izmailov, Mikhail V. Solodov
    claim paper
    Read More »
    MOC
    2000
    85views more  MOC 2000»
    Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
    13 years 4 months ago
    Improving the convergence of non-interior point algorithms for nonlinear complementarity problems
    Download  www.ams.org
    Recently, based upon the Chen-Harker-Kanzow-Smale smoothing function and the trajectory and the neighbourhood techniques, Hotta and Yoshise proposed a noninterior point algorithm f...
    Liqun Qi, Defeng Sun
    claim paper
    Read More »
    AMC
    2007
    95views more  AMC 2007»
    On a new class parametrized Newton-like method for semismooth equations
    13 years 4 months ago
    On a new class parametrized Newton-like method for semismooth equations
    Download  www.math.uni.lodz.pl
    : An extension of some smooth parametrized Newton-like method to the semismooth case is presented in this paper. Thus, the problems due to the fact the B-differential is singular ...
    Marek J. Smietanski
    claim paper
    Read More »
    MP
    2008
    129views more  MP 2008»
    Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
    13 years 4 months ago
    Corrector-predictor methods for monotone linear complementarity problems in a wide neighborhood of the central path
    Download  www.optimization-online.org
    Abstract. Two corrector-predictor interior point algorithms are proposed for solving monotone linear complementarity problems. The algorithms produce a sequence of iterates in the ...
    Florian A. Potra
    claim paper
    Read More »
    SIAMJO
    2002
    89views more  SIAMJO 2002»
    A Probability-One Homotopy Algorithm for Nonsmooth Equations and Mixed Complementarity Problems
    13 years 4 months ago
    A Probability-One Homotopy Algorithm for Nonsmooth Equations and Mixed Complementarity Problems
    Download  eprints.cs.vt.edu
    A probability-one homotopy algorithm for solving nonsmooth equations is described. This algorithm is able to solve problems involving highly nonlinear equations, where the norm of ...
    Stephen C. Billups, Layne T. Watson
    claim paper
    Read More »
    Explore & Download
    Proceedings Preprints Top 5 Ranked Papers Publications Books Software Tutorials Presentations Lectures Notes Datasets
    Productivity Tools
    International On-screen Keyboard Graphical Social Symbols OCR Text Recognition CSS3 Style Generator Web Page to PDF Web Page to Image PDF Split PDF Merge Latex Equation Editor Sci2ools
    Document Tools
    PDF to Text PDF to Postscript PDF to Thumbnails Excel to PDF Word to PDF Postscript to PDF PowerPoint to PDF Latex to Word Repair Corrupted PDF
    Image Tools
    JPG to PS JPG to PDF Extract Images from PDF Image Converter
    Sciweavers
    About Community Cookies Privacy Policy Terms of Use

    Copyright © Sciweavers LLC, 2009-2024, USA.