Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds (Q1369047): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4003375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of Interior Point Algorithms for the Monotone Linear Complementarity Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Superlinear Convergence of Interior-Point Algorithms for a General Class of Problems / 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: Q4257419 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of linear complementarity problems using minimization with simple bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new strategy for solving variational inequalities in bounded polytopes<sup>∗</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear complementarity as unconstrained optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear complementarity as unconstrained and constrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent differentiable optimization problems and descent methods for asymmetric variational inequality problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global Convergence of a Class of Trust Region Algorithms for Optimization with Simple Bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new trust region algorithm for bound constrained minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The gap function of a convex program / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Merit Function and a Successive Quadratic Programming Algorithm for Variational Inequality Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4257435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unconstrained optimization reformulations of variational inequality problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Resolution of Linearly Constrained Convex Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tensor Methods for Unconstrained Optimization Using Second Derivatives / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4135211 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 652 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing Algorithms for Solving Sparse Nonlinear Systems of Equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4257421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A nonsmooth inexact Newton method for the solution of large-scale nonlinear complementarity problems / rank
 
Normal rank

Revision as of 18:20, 27 May 2024

scientific article
Language Label Description Also known as
English
Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds
scientific article

    Statements

    Solution of finite-dimensional variational inequalities using smooth optimization with simple bounds (English)
    0 references
    7 October 1997
    0 references
    box constrained optimization
    0 references
    variational inequality
    0 references
    smooth minimization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers