Smoothing SQP algorithm for semismooth equations with box constraints
From MaRDI portal
Publication:2376126
DOI10.1007/s10589-012-9524-5zbMath1295.90105OpenAlexW2074425123MaRDI QIDQ2376126
Qian Liu, Cheng Ma, Chang-Yu Wang
Publication date: 26 June 2013
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-012-9524-5
global convergencefinite terminationSQP algorithmsuperlinear convergence ratesemismooth equations with box constraints
Related Items
Generalized Newton method for a kind of complementarity problem ⋮ On an exact penalty function method for nonlinear mixed discrete programming problems and its applications in search engine advertising problems ⋮ Analysis on Newton projection method for the split feasibility problem
Cites Work
- Unnamed Item
- Unnamed Item
- Convergence properties of nonmonotone spectral projected gradient methods
- NE/SQP: A robust algorithm for the nonlinear complementarity problem
- An iterative method for solving semismooth equations
- Active-set projected trust-region algorithm for box-constrained nonsmooth equations
- Affine scaling interior Levenberg-Marquardt method for bound-constrained semismooth equations under local error bound conditions
- A new smoothing Newton-type algorithm for semi-infinite programming
- On a new class parametrized Newton-like method for semismooth equations
- On a semi-smooth Newton method and its globalization
- Secant methods for semismooth equations
- Nonlinear complementarity as unconstrained and constrained minimization
- Semismooth Newton methods for solving semi-infinite programming problems
- A modified secant method for semismooth equations
- A smoothing projected Newton-type method for semismooth equations with bound constraints
- Local convergence analysis of projection-type algorithms: unified approach
- On the resolution of monotone complementarity problems
- Some methods based on the D-gap function for solving monotone variational inequalities
- A nonsmooth version of Newton's method
- An interior-point affine-scaling trust-region method for semismooth equations with box constraints
- A nonsmooth Levenberg-Marquardt method for solving semi-infinite programming problems
- The quadratic convergence of a smoothing Levenberg-Marquardt method for nonlinear complementarity problem
- Convergence analysis of nonsmooth equations for the general nonlinear complementarity problem
- Nonmonotone Trust-Region Methods for Bound-Constrained Semismooth Equations with Applications to Nonlinear Mixed Complementarity Problems
- Weak Sharp Minima in Mathematical Programming
- The Semismooth Approach for Semi-Infinite Programming without Strict Complementarity
- A New Exact Penalty Function
- A primal-dual algorithm for minimizing a sum of Euclidean norms
- Globally convergent Broyden-like methods for semismooth equations and applications to VIP, NCP and MCP
