A note on quadratic convergence of a smoothing Newton algorithm for the LCP (Q1941195): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Sheng-Long Hu / rank
Normal rank
 
Property / author
 
Property / author: Sheng-Long Hu / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-011-0436-6 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2028448817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and nonsmooth analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonmonotone smoothing Newton algorithm for solving nonlinear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating a maximally complementary solution of the monotone NCP by using non-interior-point smoothing algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sub-quadratic convergence of a smoothing Newton algorithm for the \(P_0\)- and monotone LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A non-interior continuation algorithm for the \(P_0\) or \(P*\) LCP with strong global and local convergence properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence properties of a non-interior-point smoothing algorithm for the \(P*\)NCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Optimization Approach to the Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A class of linear complementarity problems solvable in polynomial time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of $P_0 $-Matrix Linear Complementarity Problems Using a potential Reduction Algorithm / 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: Improving the convergence of non-interior point algorithms for nonlinear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A regularization Newton method for solving nonlinear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P<sub>0</sub>LCPs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 06:04, 6 July 2024

scientific article
Language Label Description Also known as
English
A note on quadratic convergence of a smoothing Newton algorithm for the LCP
scientific article

    Statements

    A note on quadratic convergence of a smoothing Newton algorithm for the LCP (English)
    0 references
    0 references
    0 references
    12 March 2013
    0 references
    linear complementarity problem
    0 references
    smoothing Newton algorithm
    0 references
    quadratic convergence
    0 references

    Identifiers