Active-set projected trust-region algorithm for box-constrained nonsmooth equations
From MaRDI portal
Recommendations
- An active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations
- An active-set projected trust region algorithm for box constrained optimization problems
- scientific article; zbMATH DE number 679863
- Nonmonotone trust-region method for solving bound-constrained nonlinear systems without nonsingular assumption
- A non-monotone projected trust-region method for bound-constrained semismooth equations
Cites work
- scientific article; zbMATH DE number 679863 (Why is no real title available?)
- scientific article; zbMATH DE number 1059236 (Why is no real title available?)
- A New Nonsmooth Equations Approach to Nonlinear Complementarity Problems
- A QP-free constrained Newton-type method for variational inequality problems
- A Trust Region Method for Solving Generalized Complementarity Problems
- A feasible semismooth asymptotically Newton method for mixed complementarity problems
- An active set-type Newton method for constrained nonlinear systems
- An affine scaling trust-region approach to bound-constrained nonlinear systems
- Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations
- Engineering and Economic Applications of Complementarity Problems
- Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
- New constrained optimization reformulation of complementarity problems
- Nonmonotone trust-region methods for bound-constrained semismooth equations with applications to nonlinear mixed complementarity problems
- Nonsmooth Equations: Motivation and Algorithms
- On smoothing methods for the \(P_{0}\) matrix linear complementarity problem
- On the resolution of monotone complementarity problems
- On the truncated conjugate gradient method
- On unconstrained and constrained stationary points of the implicit Lagrangian
- Optimization and nonsmooth analysis
- Projected gradient methods for linearly constrained problems
- Regular pseudo-smooth NCP and BVIP functions and globally and quadratically convergent generalized Newton methods for complementarity and variational inequality problems
- Strictly feasible equation-based methods for mixed complementarity problems
- Test examples for nonlinear programming codes
- The Conjugate Gradient Method and Trust Regions in Large Scale Optimization
Cited in
(47)- Three derivative-free projection methods for nonlinear equations with convex constraints
- A trust region algorithm with conjugate gradient technique for optimization problems
- An active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations
- The Lagrangian globalization method for nonsmooth constrained equations
- scientific article; zbMATH DE number 679863 (Why is no real title available?)
- A projected derivative-free algorithm for nonlinear equations with convex constraints
- Levenberg-Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- A trust-region LP-Newton method for constrained nonsmooth equations under Hölder metric subregularity
- Pseudotransient continuation for solving systems of nonsmooth equations with inequality constraints
- A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints
- A convergence analysis of hybrid gradient projection algorithm for constrained nonlinear equations with applications in compressed sensing
- A conjugate gradient algorithm for large-scale unconstrained optimization problems and nonlinear equations
- A globally convergent matrix-free method for constrained equations and its linear convergence rate
- A generalized hybrid CGPM-based algorithm for solving large-scale convex constrained equations with applications to image restoration
- A conjugate gradient projection method with restart procedure for solving constraint equations and image restorations
- Two spectral gradient projection methods for constrained equations and their linear convergence rate
- Solving equations via the trust region and its application to a class of stochastic linear complementarity problems
- Sufficient descent Polak-Ribière-Polyak conjugate gradient algorithm for large-scale box-constrained optimization
- An active set-type Newton method for constrained nonlinear systems
- An interior-point affine-scaling trust-region method for semismooth equations with box constraints
- A projection-based hybrid PRP-DY type conjugate gradient algorithm for constrained nonlinear equations with applications
- Trust-region method for box-constrained semismooth equations and its applications to complementary problems
- Smoothing nonmonotone Barzilai-Borwein gradient method and its application to stochastic linear complementarity problems
- A modified inertial three-term conjugate gradient projection method for constrained nonlinear equations with applications in compressed sensing
- An effective inertial-relaxed CGPM for nonlinear monotone equations
- Spectral residual methods with two new non-monotone line searches for large-scale nonlinear systems of equations
- Semismooth Newton methods with a shooting-like technique for solving a constrained free-boundary HJB equation
- Multivariate encryption schemes based on polynomial equations over real numbers
- A trust region method with project step for bound constrained optimization without compact condition
- Smoothing SQP algorithm for semismooth equations with box constraints
- On the convergence of a trust-region method for solving constrained nonlinear equations with degenerate solutions
- Spectral gradient projection method for monotone nonlinear equations with convex constraints
- An active-set projected trust region algorithm for box constrained optimization problems
- A nonmonotone trust-region method for generalized Nash equilibrium and related problems with strong convergence properties
- A new smoothing Newton method for solving constrained nonlinear equations
- Improved smoothing Newton methods for \(P_0\) nonlinear complementarity problems
- Partially symmetrical derivative-free Liu-Storey projection method for convex constrained equations
- A modified Hestenes-Stiefel projection method for constrained nonlinear equations and its linear convergence rate
- Levenberg--Marquardt methods with strong local convergence properties for solving nonlinear equations with convex constraints
- A new Levenberg-Marquardt type algorithm for solving nonsmooth constrained equations
- Gradient trust region algorithm with limited memory BFGS update for nonsmooth convex minimization
- A Cauchy point direction trust region algorithm for nonlinear equations
- Some modified Hestenes-Stiefel conjugate gradient algorithms with application in image restoration
- An IDFPM-based algorithm without Lipschitz continuity to constrained nonlinear equations for sparse signal and blurred image restoration problems
- An interior global method for nonlinear systems with simple bounds
- Practical active-set Euclidian trust-region method with spectral projected gradients for bound-constrained minimization
- A modified spectral gradient projection-based algorithm for large-scale constrained nonlinear equations with applications in compressive sensing
This page was built for publication: Active-set projected trust-region algorithm for box-constrained nonsmooth equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q704744)
