A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
From MaRDI portal
Recommendations
- Global and superlinear convergence of the smoothing Newton method and its application to general box constrained variational inequalities
- Smoothing functions and smoothing Newton method for complementarity and variational inequality problems
- A smoothing inexact Newton method for nonlinear complementarity problems
- A Jacobian smoothing method for box constrained variational inequality problems
- scientific article; zbMATH DE number 1844030
Cited in
(only showing first 100 items - show all)- A new non-interior continuation method for \(P_0\)-NCP based on a SSPM-function.
- Strong convergence properties of a modified nonmonotone smoothing algorithm for the SCCP
- Tensor absolute value equations
- A smoothing Newton method for symmetric cone complementarity problem
- A smoothing Broyden-like method with a nonmonotone derivative-free line search for nonlinear complementarity problems
- A smoothing Newton algorithm for a class of non-monotonic symmetric cone linear complementarity problems
- Homotopy method for solving ball-constrained variational inequalities
- Solvability of Newton equations in smoothing-type algorithms for the SOCCP
- A nonmonotone smoothing Newton algorithm for solving general box constrained variational inequalities
- Analysis of smoothing-type algorithms for the convex second-order cone programming
- A Levenberg-Marquardt method for nonlinear complementarity problems based on nonmonotone trust region and line search techniques
- Unified smoothing functions for absolute value equation associated with second-order cone
- Finite termination of a smoothing-type algorithm for the monotone affine variational inequality problem
- A nonmonotone smoothing Newton algorithm for solving box constrained variational inequalities with a \(P_0\) function
- A smoothing Newton method for mathematical programs constrained by parameterized quasi-variational inequalities
- An active set smoothing method for solving unconstrained minimax problems
- A primal-dual algorithm for minimizing a sum of Euclidean norms
- A smoothing Newton-type method for solving the \(L _{2}\) spectral estimation problem with lower and upper bounds
- A cosh-based smoothing Newton method for \(P_{0}\) nonlinear complementarity problem
- A regularization Newton method based on the generalized Fischer-Burmeister smoothing function for the NCP
- Superlinear noninterior one-step continuation method for monotone LCP in the absence of strict complementarity.
- A nonmonotone smoothing Newton method for circular cone programming
- A smoothing Newton method with a mixed line search for monotone weighted complementarity problems
- A note on quadratic convergence of a smoothing Newton algorithm for the LCP
- A smoothing Newton method for mathematical programs governed by second-order cone constrained generalized equations
- A globally and quadratically convergent algorithm for solving multilinear systems with \(\mathcal {M}\)-tensors
- A smoothing approach for the optimal parameter selection problem with continuous inequality constraint
- A predictor-corrector smoothing Newton method for symmetric cone complementarity problems
- Finite termination of a Newton-type algorithm for a class of affine variational inequality problems
- A new filter-Levenberg-Marquardt method with disturbance for solving nonlinear complementarity problems
- A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming
- A filter method for solving nonlinear complementarity problems based on derivative-free line search
- Nonsingularity in matrix conic optimization induced by spectral norm via a smoothing metric projector
- Moreau-Yosida regularization of Lagrangian-dual functions for a class of convex optimization problems
- A smoothing Newton-type method for generalized nonlinear complementarity problem
- A smoothing-type Newton method for second-order cone programming problems based on a new smooth function
- A smoothing Broyden-like method for the mixed complementarity problems
- Sufficient conditions on nonemptiness and boundedness of the solution set of the \(P_{0}\) function nonlinear complementarity problem
- A regularized smoothing-type algorithm for solving a system of inequalities with a \(P_{0}\)-function
- A smoothing Newton method for ncps with the \(P_{0}\)-property
- On the finite convergence of Newton-type methods for \(P_{0}\) affine variational inequalities
- Tensor complementarity problems. II: Solution methods
- Convergence of a smoothing-type algorithm for the monotone affine variational inequality problem
- Predictor-corrector smoothing methods for monotone LCP
- A smoothing QP-free infeasible method for nonlinear inequality constrained optimization
- An interior penalty approach to a large-scale discretized obstacle problem with nonlinear constraints
- Inexact Newton and quasi-Newton methods for the output feedback pole assignment problem
- Formulating an \(n\)-person noncooperative game as a tensor complementarity problem
- A new nonmonotone smoothing Newton method for the symmetric cone complementarity problem with the Cartesian \(P_0\)-property
- A smoothing Levenberg-Marquardt method for the extended linear complementarity problem
- Finite termination of a Newton-type algorithm based on a new class of smoothing functions for the affine variational inequality problem
- A new Levenberg-Marquardt type algorithm for solving nonsmooth constrained equations
- Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem
- A smoothing Newton method for absolute value equation associated with second-order cone
- Globally and quadratically convergent algorithm for minimizing the sum of Euclidean norms
- A smoothing inexact Newton method for variational inequalities with nonlinear constraints
- Regularized smoothing approximations to vertical nonlinear complementarity problems
- A new smoothing Newton-type algorithm for semi-infinite programming
- A regularized smoothing Newton method for solving SOCCPs based on a new smoothing C-function
- A new one-step smoothing Newton method for second-order cone programming.
- A one-step smoothing Newton method for second-order cone programming
- Solving variational inequality problems via smoothing-nonsmooth reformulations
- scientific article; zbMATH DE number 1059220 (Why is no real title available?)
- Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity
- On almost smooth functions and piecewise smooth functions
- A new non-interior continuation method for solving the second-order cone complementarity problem
- A regularization smoothing Newton method for solving nonlinear complementarity problem
- Analysis of a smoothing Newton method for second-order cone complementarity problem
- A smoothing method for solving portfolio optimization with CVaR and applications in allocation of generation asset
- Jacobian consistency of a one-parametric class of smoothing Fischer-Burmeister functions for SOCCP
- A smoothing Newton method for semi-infinite programming
- A nonmonotone smoothing-type algorithm for solving a system of equalities and inequalities
- A smoothing inexact Newton method for nonlinear complementarity problems
- A smoothing projected Newton-type algorithm for semi-infinite programming
- A regularized smoothing Newton method for solving the symmetric cone complementarity problem
- Improved smoothing Newton methods for symmetric cone complementarity problems
- Solving unbounded box constrained variational inequalities via a homotopy method
- A smoothing-type algorithm for solving system of inequalities
- A new one-step smoothing Newton method for the second-order cone complementarity problem
- The quadratic convergence of a smoothing Levenberg-Marquardt method for nonlinear complementarity problem
- Smoothing algorithms for complementarity problems over symmetric cones
- A one-parametric class of smoothing functions for second-order cone programming
- The numerical study of a regularized smoothing Newton method for solving \(P_{0}\)-NCP based on the generalized smoothing Fischer-Burmeister function
- The convergence of a smoothing damped Gauss-Newton method for nonlinear complementarity problem
- An inexact smoothing method for SOCCPs based on a one-parametric class of smoothing function
- A smoothing Newton algorithm for weighted linear complementarity problem
- A smoothing method for second order cone complementarity problem
- A smoothing-type algorithm for solving linear complementarity problems with strong convergence properties
- Superlinear/quadratic one-step smoothing Newton method for \(P_0\)-NCP
- A Regularized Smoothing Newton Method for Box Constrained Variational Inequality Problems with P0-Functions
- Smoothing Newton algorithm for the second-order cone programming with a nonmonotone line search
- A smoothing Newton's method for the construction of a damped vibrating system from noisy test eigendata
- A smoothing conjugate gradient method for solving systems of nonsmooth equations
- A smoothing Newton method based on a one-parametric class of smoothing function for SOCCP
- A smoothing Levenberg-Marquardt method for NCP
- A smoothing Gauss-Newton method for the generalized HLCP
- A new smoothing and regularization Newton method for \(P_{0}\)-NCP
- A globally convergent Levenberg-Marquardt method for solving nonlinear complementarity problem
- Smoothing-type algorithm for solving linear programs by using an augmented complementarity problem
- Global convergence of a smooth approximation method for mathematical programs with complementarity constraints
This page was built for publication: A new look at smoothing Newton methods for nonlinear complementarity problems and box constrained variational inequalities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1970293)
