Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems
From MaRDI portal
Publication:5437523
DOI10.1080/10556780701296455zbMath1188.90258OpenAlexW2123093332MaRDI QIDQ5437523
Stefania Petra, Christian Kanzow
Publication date: 21 January 2008
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556780701296455
global convergencequadratic convergencecomplementarity problemsfilter methodtrust region methodssemismooth functionsnonlinear least squares reformulationCauchy step
Related Items
Exact penalties for variational inequalities with applications to nonlinear complementarity problems, A locally convergent inexact projected Levenberg-Marquardt-type algorithm for large-scale constrained nonsmooth equations, On the convergence of an inexact Gauss-Newton trust-region method for nonlinear least-squares problems with simple bounds, A kind of stochastic eigenvalue complementarity problems, A feasible decomposition method for constrained equations and its application to complementarity problems, Nonsmooth Levenberg-Marquardt type method for solving a class of stochastic linear complementarity problems with finitely many elements, Trust-region method for box-constrained semismooth equations and its applications to complementary problems, A trust-region approach with novel filter adaptive radius for system of nonlinear equations, MINQ8: general definite and bound constrained indefinite quadratic programming, A smoothing Newton method based on the generalized Fischer-Burmeister function for MCPs, A unified local convergence analysis of inexact constrained Levenberg-Marquardt methods, Numerical comparisons of two effective methods for mixed complementarity problems, An efficient algorithm for solving supply chain network equilibria and equivalent supernetwork based traffic network equilibria, Solving nearly-separable quadratic optimization problems as nonsmooth equations, Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities
Uses Software
Cites Work
- Unnamed Item
- Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
- A new class of semismooth Newton-type methods for nonlinear complementarity problems
- On NCP-functions
- Solution of monotone complementarity problems with locally Lipschitzian functions
- A semismooth equation approach to the solution of nonlinear complementarity problems
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- On the superlinear local convergence of a filter-SQP method
- Feasible descent algorithms for mixed complementarity problems
- A nonsmooth version of Newton's method
- Nonmonotone Trust-Region Methods for Bound-Constrained Semismooth Equations with Applications to Nonlinear Mixed Complementarity Problems
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- Nonsmooth Equations: Motivation and Algorithms
- Computing a Trust Region Step
- Optimization and nonsmooth analysis
- Strongly Regular Generalized Equations
- Global Convergence of Trust-region Interior-point Algorithms for Infinite-dimensional Nonconvex Minimization Subject to Pointwise Bounds
- A special newton-type optimization method
- A Trust Region Method for Solving Generalized Complementarity Problems
- Trust Region Methods
- A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares
- On a semismooth least squares formulation of complementarity problems with gap reduction
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- On the Global Convergence of a Filter--SQP Algorithm
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- Global Convergence Analysis of the Generalized Newton and Gauss-Newton Methods of the Fischer-Burmeister Equation for the Complementarity Problem
- Strictly feasible equation-based methods for mixed complementarity problems
- Nonlinear programming without a penalty function.