A Superlinearly Convergent Smoothing Newton Continuation Algorithm for Variational Inequalities over Definable Sets
From MaRDI portal
Publication:5255000
DOI10.1137/140957615zbMath1320.90091OpenAlexW2108140204MaRDI QIDQ5255000
Chek Beng Chua, Le Thi Khanh Hien
Publication date: 11 June 2015
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/10356/103355
variational inequalitiessuperlinear convergencebarrier-based smoothing approximationsmoothing Newton continuation
Numerical mathematical programming methods (65K05) Variational and other types of inequalities involving nonlinear operators (general) (47J20) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items
A global linear and local superlinear (quadratic) inexact non-interior continuation method for variational inequalities over general closed convex sets, Spectral Operators of Matrices: Semismoothness and Characterizations of the Generalized Jacobian, Convergence analysis of a projection algorithm for variational inequality problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smoothing functions and smoothing Newton method for complementarity and variational inequality problems
- First order tameness of measures
- Tame functions are semismooth
- Faces of the unit ball of a unitarily invariant norm
- On the real exponential field with restricted analytic functions
- Expansions of the real field with power functions
- An infeasible-interior-point algorithm for linear complementarity problems
- The elementary theory of restricted analytic fields with exponentiation
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- Geometric categories and o-minimal structures
- A nonsmooth version of Newton's method
- Hyperbolic programs, and their derivative relaxations
- An introduction to a class of matrix cone programming
- Computational aspects of general equilibrium theory. Refutable theories of value
- Hyperbolic Polynomials and Convex Analysis
- A Barrier-Based Smoothing Proximal Point Algorithm for NCPs over Closed Convex Cones
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Interior-Point Method for Nuclear Norm Approximation with Application to System Identification
- Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
- Optimization and nonsmooth analysis
- A generalization of the Tarski-Seidenberg theorem, and some nondefinability results
- Equivalence of the Complementarity Problem to a System of Nonlinear Equations
- Semismooth and Semiconvex Functions in Constrained Optimization
- A computable generalized Hessian of the D-gap function and Newton-type methods for variational inequality problems
- Jacobian Smoothing Methods for Nonlinear Complementarity Problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- A T-Algebraic Approach to Primal-Dual Interior-Point Algorithms
- Large-Step Interior Point Algorithms for Linear Complementarity Problems
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- Semismooth Matrix-Valued Functions
- On the generic properties of convex optimization problems in conic form
- Solving variational inequality problems via smoothing-nonsmooth reformulations
- A further result on an implicit function theorem for locally Lipschitz functions
