A Newton-type algorithm for solving problems of search theory (Q1953229): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58919067, #quickstatements; #temporary_batch_1711196317277
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3833854 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on the continuous nonlinear resource allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved simulated annealing algorithm for bandwidth minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4831691 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A special newton-type optimization method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semismooth and Semiconvex Functions in Constrained Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regular Pseudo-Smooth NCP and BVIP Functions and Globally and Quadratically Convergent Generalized Newton Methods for Complementarity and Variational Inequality 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: Optimization and nonsmooth analysis / 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: Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations / rank
 
Normal rank

Latest revision as of 11:38, 6 July 2024

scientific article
Language Label Description Also known as
English
A Newton-type algorithm for solving problems of search theory
scientific article

    Statements

    A Newton-type algorithm for solving problems of search theory (English)
    0 references
    7 June 2013
    0 references
    Summary: In the survey of the continuous nonlinear resource allocation problem, Patriksson pointed out that Newton-type algorithms have not been proposed for solving the problem of search theory in the theoretical perspective. In this paper, we propose a Newton-type algorithm to solve the problem. We prove that the proposed algorithm has global and superlinear convergence. Some numerical results indicate that the proposed algorithm is promising.
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references