Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems
From MaRDI portal
Publication:5437523
Recommendations
- Nonmonotone trust-region methods for bound-constrained semismooth equations with applications to nonlinear mixed complementarity problems
- A feasible semismooth asymptotically Newton method for mixed complementarity problems
- On a semismooth least squares formulation of complementarity problems with gap reduction
- Trust-region method for box-constrained semismooth equations and its applications to complementary problems
- scientific article; zbMATH DE number 1306977
Cites work
- scientific article; zbMATH DE number 3928227 (Why is no real title available?)
- A Multidimensional Filter Algorithm for Nonlinear Equations and Nonlinear Least-Squares
- A New Merit Function For Nonlinear Complementarity Problems And A Related Algorithm
- A Trust Region Method for Solving Generalized Complementarity Problems
- A globally convergent primal-dual interior-point filter method for nonlinear programming
- A new class of semismooth Newton-type methods for nonlinear complementarity problems
- A nonsmooth version of Newton's method
- A semismooth equation approach to the solution of nonlinear complementarity problems
- A special newton-type optimization method
- An Interior Trust Region Approach for Nonlinear Minimization Subject to Bounds
- Computing a Trust Region Step
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Feasible descent algorithms for mixed complementarity problems
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Global Convergence Analysis of the Generalized Newton and Gauss-Newton Methods of the Fischer-Burmeister Equation for the Complementarity Problem
- Global Convergence of Trust-region Interior-point Algorithms for Infinite-dimensional Nonconvex Minimization Subject to Pointwise Bounds
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming
- Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- Nonlinear programming without a penalty function.
- Nonmonotone trust-region methods for bound-constrained semismooth equations with applications to nonlinear mixed complementarity problems
- Nonsmooth Equations: Motivation and Algorithms
- On NCP-functions
- On a semismooth least squares formulation of complementarity problems with gap reduction
- On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints
- On the Global Convergence of a Filter--SQP Algorithm
- On the superlinear local convergence of a filter-SQP method
- Optimization and nonsmooth analysis
- Solution of monotone complementarity problems with locally Lipschitzian functions
- Strictly feasible equation-based methods for mixed complementarity problems
- Strongly Regular Generalized Equations
- Trust Region Methods
Cited in
(16)- A smoothing Newton method based on the generalized Fischer-Burmeister function for MCPs
- 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
- A locally convergent inexact projected Levenberg-Marquardt-type algorithm for large-scale constrained nonsmooth equations
- A trust-region approach with novel filter adaptive radius for system of nonlinear equations
- Solving nearly-separable quadratic optimization problems as nonsmooth equations
- Trust-region quadratic methods for nonlinear systems of mixed equalities and inequalities
- The Levenberg-Marquardt method: an overview of modern convergence theories and more
- A unified local convergence analysis of inexact constrained Levenberg-Marquardt methods
- Exact penalties for variational inequalities with applications to nonlinear complementarity problems
- A feasible decomposition method for constrained equations and its application to complementarity problems
- On the convergence of an inexact Gauss-Newton trust-region method for nonlinear least-squares problems with simple bounds
- Trust-region method for box-constrained semismooth equations and its applications to complementary problems
- Nonsmooth Levenberg-Marquardt type method for solving a class of stochastic linear complementarity problems with finitely many elements
- MINQ8: general definite and bound constrained indefinite quadratic programming
- A kind of stochastic eigenvalue complementarity problems
This page was built for publication: Projected filter trust region methods for a semismooth least squares formulation of mixed complementarity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5437523)
