A global linear and local superlinear (quadratic) inexact non-interior continuation method for variational inequalities over general closed convex sets
From MaRDI portal
Publication:829878
DOI10.1007/s11228-020-00540-6zbMath1471.65062arXiv1802.02563OpenAlexW3010741846MaRDI QIDQ829878
Le Thi Khanh Hien, Chek Beng Chua
Publication date: 6 May 2021
Published in: Set-Valued and Variational Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.02563
variational inequalitystrict complementaritypolyhedral setsmoothing approximationepigraph of matrix nuclear normepigraph of matrix operator norminexact non-interior continuation method
Convex programming (90C25) Nonlinear programming (90C30) Numerical methods for variational inequalities and related problems (65K15)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smoothing functions and smoothing Newton method for complementarity and variational inequality problems
- A B-differentiable equation-based, globally and locally quadratically convergent algorithm for nonlinear programs, complementarity and variational inequality problems
- Faces of the unit ball of a unitarily invariant norm
- Non-interior continuation methods for solving semidefinite complementarity problems
- Jacobian-free Newton-Krylov methods: a survey of approaches and applications.
- The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform \(P\)-functions
- A class of smoothing functions for nonlinear and mixed complementarity problems
- Smoothing Newton and quasi-Newton methods for mixed complementarity problems
- A continuation method for monotone variational inequalities
- A nonsmooth version of Newton's method
- An introduction to a class of matrix cone programming
- On Newton-like methods
- The Global Linear Convergence of a Noninterior Path-Following Algorithm for Linear Complementarity Problems
- A Globally Convergent Newton-GMRES Subspace Method for Systems of Nonlinear Equations
- A Barrier-Based Smoothing Proximal Point Algorithm for NCPs over Closed Convex Cones
- A Continuation Method for Nonlinear Complementarity Problems over Symmetric Cones
- A Non-Interior-Point Continuation Method for Linear Complementarity Problems
- Newton's Method for B-Differentiable Equations
- Hybrid Krylov Methods for Nonlinear Systems of Equations
- GMRES: A Generalized Minimal Residual Algorithm for Solving Nonsymmetric Linear Systems
- Inexact Newton Methods
- On Homotopy-Smoothing Methods for Box-Constrained Variational Inequalities
- Global Convergence of Damped Newton's Method for Nonsmooth Equations via the Path Search
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- NITSOL: A Newton Iterative Solver for Nonlinear Systems
- Hermitian and Skew-Hermitian Splitting Methods for Non-Hermitian Positive Definite Linear Systems
- Block Triangular and Skew-Hermitian Splitting Methods for Positive-Definite Linear Systems
- A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions
- Some Noninterior Continuation Methods for Linear Complementarity Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A Superlinearly Convergent Smoothing Newton Continuation Algorithm for Variational Inequalities over Definable Sets
- On the generic properties of convex optimization problems in conic form
