The Lagrangian globalization method for nonsmooth constrained equations
From MaRDI portal
Publication:2506171
DOI10.1007/s10589-005-5960-9zbMath1103.90077OpenAlexW2053344134MaRDI QIDQ2506171
Xiaojiao Tong, Liqun Qi, Yu-Fei Yang
Publication date: 28 September 2006
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-005-5960-9
Related Items
Partially symmetrical derivative-free Liu–Storey projection method for convex constrained equations ⋮ A class of parameter-free filled functions for box-constrained system of nonlinear equations ⋮ A filled function method for nonlinear equations ⋮ A new filled function method for an unconstrained nonlinear equation ⋮ Unnamed Item ⋮ A new conjugate gradient projection method for convex constrained nonlinear equations ⋮ An inexact modified subgradient algorithm for nonconvex optimization ⋮ Spectral gradient projection method for monotone nonlinear equations with convex constraints ⋮ A new auxiliary function method for systems of nonlinear equations ⋮ A new filled function method for nonlinear equations ⋮ A novel filled function method for nonlinear equations ⋮ Three derivative-free projection methods for nonlinear equations with convex constraints
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- Active-set projected trust-region algorithm for box-constrained nonsmooth equations
- Implementation of a continuation method for normal maps
- On unconstrained and constrained stationary points of the implicit Lagrangian
- A feasible semismooth asymptotically Newton method for mixed complementarity problems
- Global optimization techniques for mixed complementarity problems
- On the convergence of a trust-region method for solving constrained nonlinear equations with degenerate solutions
- NCP functions applied to Lagrangian globalization for the nonlinear complementarity problem
- An affine scaling trust-region approach to bound-constrained nonlinear systems
- Improving the robustness of descent-based methods for semismooth equations using proximal perturbations
- A nonsmooth version of Newton's method
- Nonmonotone Trust-Region Methods for Bound-Constrained Semismooth Equations with Applications to Nonlinear Mixed Complementarity Problems
- A Probability-One Homotopy Algorithm for Nonsmooth Equations and Mixed Complementarity Problems
- A Globally Convergent Augmented Lagrangian Algorithm for Optimization with General Constraints and Simple Bounds
- Optimization and nonsmooth analysis
- Projected gradient methods for linearly constrained problems
- A Potential Reduction Newton Method for Constrained Equations
- Global Methods for Nonlinear Complementarity Problems
- A Globally Convergent Augmented Lagrangian Pattern Search Algorithm for Optimization with General Constraints and Simple Bounds
- Finite-Dimensional Variational Inequalities and Complementarity Problems
- Globalization of Newton's Method for Solving Non-linear Equations
- Strictly feasible equation-based methods for mixed complementarity problems
- Lagrangian globalization methods for nonlinear complementarity problems