A nonmonotone smoothing Newton algorithm for weighted complementarity problem
From MaRDI portal
Publication:2046534
DOI10.1007/s10957-021-01839-6zbMath1475.90115OpenAlexW3137061419MaRDI QIDQ2046534
Publication date: 18 August 2021
Published in: Journal of Optimization Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10957-021-01839-6
symmetric conesmoothing Newton algorithmsuperlinear/quadratic convergenceJacobian nonsingularityweighted complementarity problem
Convex programming (90C25) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Complexity and performance of numerical algorithms (65Y20)
Related Items
A modified damped Gauss–Newton method for non-monotone weighted linear complementarity problems, A global convergent semi-smooth Newton method for semi-linear elliptic optimal control 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, An accelerated smoothing Newton method with cubic convergence for weighted complementarity problems, Quadratic convergence analysis of a nonmonotone Levenberg-Marquardt type method for the weighted nonlinear complementarity problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A smoothing Newton algorithm for weighted linear complementarity problem
- Sufficient weighted complementarity problems
- A regularized smoothing Newton method for solving the symmetric cone complementarity problem
- Extension of smoothing Newton algorithms to solve linear programming over symmetric cones
- A smoothing Newton method with Fischer-Burmeister function for second-order cone complementarity problems
- Some P-properties for linear transformations on Euclidean Jordan algebras
- Smoothing algorithms for complementarity problems over symmetric cones
- A one-parametric class of merit functions for the symmetric cone complementarity problem
- A smoothing Newton algorithm based on a one-parametric class of smoothing functions for linear programming over symmetric cones
- Convergence of a smoothing algorithm for symmetric cone complementarity problems with a nonmonotone line search
- A truncated Newton method with non-monotone line search for unconstrained optimization
- Error bounds in mathematical programming
- New error bounds and their applications to convergence analysis of iterative algorithms
- A generalized smoothing Newton method for the symmetric cone complementarity problem
- Strong convergence properties of a modified nonmonotone smoothing algorithm for the SCCP
- Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity
- A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem
- A variant nonmonotone smoothing algorithm with improved numerical results for large-scale LWCPS
- A full-Newton step interior-point method for monotone weighted linear complementarity problems
- A smoothing Newton algorithm for a class of non-monotonic symmetric cone linear complementarity problems
- A smoothing Newton method for symmetric cone complementarity problem
- A nonsmooth version of Newton's method
- Smoothing Newton algorithm for symmetric cone complementarity problems based on a one-parametric class of smoothing functions
- The convergence of a modified smoothing-type algorithm for the symmetric cone complementarity problem
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- The modified Levenberg-Marquardt method for nonlinear equations with cubic convergence
- Löwner's Operator and Spectral Functions in Euclidean Jordan Algebras
- A Regularized Smoothing Newton Method for Symmetric Cone Complementarity Problems
- Optimization and nonsmooth analysis
- A Nonmonotone Line Search Technique and Its Application to Unconstrained Optimization
- Weighted Complementarity Problems---A New Paradigm for Computing Equilibria
- Interior-point algorithms for a generalization of linear programming and weighted centring
- Accelerating the modified Levenberg-Marquardt method for nonlinear equations
- Interior Point Trajectories and a Homogeneous Model for Nonlinear Complementarity Problems over Symmetric Cones
