Finite termination of a Newton-type algorithm for a class of affine variational inequality problems (Q613275): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A global linear and local quadratic continuation smoothing method for variational inequalities with box constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4000274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new one-step smoothing Newton method for nonlinear complementarity problem with \(P_{0}\)-function / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the finite termination of an entropy function based non-interior continuation method for vertical linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computational complexity of LCPs associated with positive definite symmetric matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finite termination of an iterative method for linear complementarity problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A relaxed projection method for variational inequalities / rank
 
Normal rank
Property / cites work
 
Property / cites work: A neural network for monotone variational inequalities with linear constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sufficient conditions on nonemptiness and boundedness of the solution set of the \(P_{0}\) function nonlinear complementarity problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smoothing algorithms for complementarity problems over symmetric cones / 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 smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4658633 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Strongly Polynomial Rounding Procedure Yielding a Maximally Complementary Solution for $P_*(\kappa)$ Linear Complementarity Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding an interior point in the optimal face of linear programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search / 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 nonsmooth version of Newton's method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4528278 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A smoothing Newton algorithm for the LCP with a sufficient matrix that terminates finitely at a maximally complementary solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-step smoothing Newton method for solving the mixed complementarity problem with a \(P_{0}\) function / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the finite convergence of interior-point algorithms for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Identification of the optimal active set in a noninterior continuation method for LCP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual neural network for convex quadratic programming subject to linear equality and inequality constraints / rank
 
Normal rank

Revision as of 13:39, 3 July 2024

scientific article
Language Label Description Also known as
English
Finite termination of a Newton-type algorithm for a class of affine variational inequality problems
scientific article

    Statements

    Finite termination of a Newton-type algorithm for a class of affine variational inequality problems (English)
    0 references
    0 references
    0 references
    20 December 2010
    0 references
    affine variational inequality problem
    0 references
    generalized Newton method
    0 references
    smoothing Newton method
    0 references
    finite termination
    0 references
    algorithm
    0 references
    numerical results
    0 references
    0 references
    0 references
    0 references

    Identifiers