A Newton-type algorithm for solving problems of search theory

DOI10.1155/2013/513918zbMath1264.90099WikidataQ58919067 ScholiaQ58919067MaRDI QIDQ1953229

Li-ping Zhang

Publication date: 7 June 2013

Published in: Advances in Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1155/2013/513918

Mathematics Subject Classification ID

65K05: Numerical mathematical programming methods

90B40: Search theory

91B32: Resource and cost allocation (including fair division, apportionment, etc.)

Related Items

An Exact Algorithm for Large-Scale Continuous Nonlinear Resource Allocation Problems with Minimax Regret Objectives, Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies, Solving the continuous nonlinear resource allocation problem with an interior point method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems
• A nonsmooth version of Newton's method
• A survey on the continuous nonlinear resource allocation problem
• An improved simulated annealing algorithm for bandwidth minimization
• Regular Pseudo-Smooth NCP and BVIP Functions and Globally and Quadratically Convergent Generalized Newton Methods for Complementarity and Variational Inequality Problems
• Semismooth and Semiconvex Functions in Constrained Optimization
• A special newton-type optimization method
• Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
• Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations