A nonmonotone smoothing Newton algorithm for weighted complementarity problem
From MaRDI portal
Publication:2046534
Recommendations
- A smoothing Newton algorithm for weighted linear complementarity problem
- scientific article; zbMATH DE number 7112925
- A new smoothing-type algorithm for nonlinear weighted complementarity problem
- A nonmonotone inexact smoothing Newton algorithm for the weighted second-order cone complementarity problem
- A smoothing Newton method with a mixed line search for monotone weighted complementarity problems
Cites work
- A full-Newton step interior-point method for monotone weighted linear complementarity problems
- A generalized smoothing Newton method for the symmetric cone complementarity problem
- A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- A nonsmooth version of Newton's method
- A one-parametric class of merit functions for the symmetric cone complementarity problem
- A regularized smoothing Newton method for solving the symmetric cone complementarity problem
- A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
- A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones
- A smoothing Newton algorithm for a class of non-monotonic symmetric cone linear complementarity problems
- A smoothing Newton algorithm for weighted linear complementarity problem
- A smoothing Newton method for symmetric cone complementarity problem
- A smoothing Newton method with Fischer-Burmeister function for second-order cone complementarity problems
- A survey on SOC complementarity functions and solution methods for SOCPs and SOCCPs
- A truncated Newton method with non-monotone line search for unconstrained optimization
- A variant nonmonotone smoothing algorithm with improved numerical results for large-scale LWCPS
- Accelerating the modified Levenberg-Marquardt method for nonlinear equations
- Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search
- Error bounds in mathematical programming
- Extension of smoothing Newton algorithms to solve linear programming over symmetric cones
- scientific article; zbMATH DE number 715155 (Why is no real title available?)
- scientific article; zbMATH DE number 2112997 (Why is no real title available?)
- Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
- Interior-point algorithms for a generalization of linear programming and weighted centring
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- New error bounds and their applications to convergence analysis of iterative algorithms
- Optimization and nonsmooth analysis
- Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity
- Smoothing algorithms for complementarity problems over symmetric cones
- Smoothing functions for second-order-cone complementarity problems
- Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions
- Some P-properties for linear transformations on Euclidean Jordan algebras
- Strong convergence properties of a modified nonmonotone smoothing algorithm for the SCCP
- Sufficient weighted complementarity problems
- The convergence of a modified smoothing-type algorithm for the symmetric cone complementarity problem
- The modified Levenberg-Marquardt method for nonlinear equations with cubic convergence
- Weighted complementarity problems -- A new paradigm for computing equilibria
Cited in
(30)- A variant nonmonotone smoothing algorithm with improved numerical results for large-scale LWCPS
- Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem
- A new smoothing-type algorithm for nonlinear weighted complementarity problem
- A global convergent semi-smooth Newton method for semi-linear elliptic optimal control problem
- An accelerated smoothing Newton method with cubic convergence for weighted complementarity problems
- A smoothing Newton algorithm for weighted linear complementarity problem
- A regularized nonmonotone inexact smoothing Newton algorithm for weighted symmetric cone complementarity problems
- A non-monotone inexact non-interior continuation method based on a parametric smoothing function for LWCP
- A modified damped Gauss-Newton method for non-monotone weighted linear complementarity problems
- A nonmonotone inexact smoothing Newton algorithm for the weighted second-order cone complementarity problem
- scientific article; zbMATH DE number 7112925 (Why is no real title available?)
- A smoothing Newton algorithm for the weighted second-order cone complementarity problem
- A derivative-free line search technique for Broyden-like method with applications to NCP, wLCP and SI
- A dynamic model to solve weighted linear complementarity problems
- Complexity analysis of a full-Newton step interior-point method for monotone weighted linear complementarity problems
- Levenberg-Marquardt method with a general LM parameter and a nonmonotone trust region technique
- A Neural Network Approach for Solving Weighted Nonlinear Complementarity Problems
- A non-monotone smoothing Newton algorithm for absolute value equations associated with second-order cone
- Complexity analysis of a predictor-corrector interior-point algorithm for P_()-weighted linear complementarity problems
- Sufficient weighted second-order cone complementarity problems
- One-parametric class of smoothing functions for (WSOCCP) and its Jacobian consistency
- New smooth weighted complementarity functions and a cubically convergent method for wLCP
- A modulus-based framework for weighted horizontal linear complementarity problems
- Nonmonotone smoothing inexact Newton algorithm for solving weighted horizontal linear complementarity problems
- The solvability of weighted complementarity problems and a smoothing Newton algorithm under the local error bound
- A non-monotone smoothing Newton algorithm for solving the system of generalized absolute value equations
- A unified approach to smoothing and regularization for SOCCPs under local error bound
- Analysis of the inexact modified Levenberg-Marquardt method for nonlinear equations
- The modified Levenberg-Marquardt method incorporating a new LM parameter and a nonmonotone scheme
- A smoothing Newton method with a mixed line search for monotone weighted complementarity problems
This page was built for publication: A nonmonotone smoothing Newton algorithm for weighted complementarity problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2046534)