Secant methods for semismooth equations
From MaRDI portal
Publication:1266319
DOI10.1007/s002110050369zbMath0914.65051OpenAlexW1995043720MaRDI QIDQ1266319
Liqun Qi, Defeng Sun, Florian A. Potra
Publication date: 7 June 1999
Published in: Numerische Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s002110050369
Related Items
Convergence analysis of the secant type methods ⋮ A generalized Jacobian based Newton method for semismooth block-triangular system of equations ⋮ Smoothing SQP algorithm for semismooth equations with box constraints ⋮ Newton-type methods for inverse singular value problems with multiple singular values ⋮ Nonsmooth equations approach to a constrained minimax problem. ⋮ On the local convergence of secant-type methods ⋮ Approximate Cayley transform methods for inverse eigenvalue problems and convergence analysis ⋮ On Efficiently Solving the Subproblems of a Level-Set Method for Fused Lasso Problems ⋮ An extended Ulm-like method for inverse singular value problems with multiple and/or zero singular values ⋮ An easily implementable algorithm for efficient projection onto the ordered weighted \(\ell_1\) norm ball ⋮ An Extended Two-Step Method for Inverse Eigenvalue Problems with Multiple Eigenvalues ⋮ A system of nonsmooth equations solver based upon subgradient method ⋮ Some quadrature-based versions of the generalized Newton method for solving nonsmooth equations ⋮ Extended Newton-type method for inverse singular value problems with multiple and/or zero singular values ⋮ A globally and superlinearly convergent quasi-Newton method for general box constrained variational inequalities without smoothing approximation ⋮ Unnamed Item ⋮ A generalized inexact Newton method for inverse eigenvalue problems ⋮ A modified secant method for semismooth equations ⋮ A nonsmooth version of the univariate optimization algorithm for locating the nearest extremum (locating extremum in nonsmooth univariate optimization) ⋮ Solving structured nonsmooth convex optimization with complexity \(\mathcal {O}(\varepsilon ^{-1/2})\) ⋮ A quasisecant method for solving a system of nonsmooth equations ⋮ A class of Steffensen type methods with optimal order of convergence ⋮ On a Steffensen's type method and its behavior for semismooth equations ⋮ On a new class parametrized Newton-like method for semismooth equations ⋮ Convergence of a Ulm-like method for square inverse singular value problems with multiple and zero singular values ⋮ A parametrized Newton method for nonsmooth equations with finitely many maximum functions ⋮ Hybrid Newton-type method for a class of semismooth equations ⋮ Convergence analysis of nonsmooth equations for the general nonlinear complementarity problem ⋮ Globally and superlinearly convergent inexact Newton-Krylov algorithms for solving nonsmooth equations ⋮ Convergence of the Newton-type methods for the square inverse singular value problems with multiple and zero singular values ⋮ Variational analysis of circular cone programs ⋮ Convergence of the modified SOR–Newton method for non-smooth equations ⋮ Global Newton-type methods and semismooth reformulations for NCP ⋮ Some Quadrature-Based Versions of the Generalized Newton Method for Solving Unconstrained Optimization Problems
