A QP-free constrained Newton-type method for variational inequality problems
From MaRDI portal
(Redirected from Publication:1295959)
Recommendations
- QP-free method for variational inequality problems
- Nonlocal quasi-Newton type method for solving convex variational inequalities
- A Newton method for a class of quasi-variational inequalities
- A quasi-Newton strategy for the SSQP method for variational inequality and optimization problems
- A new globally and superlinearly convergent QP-free method for inequality constrained optimization
- scientific article; zbMATH DE number 1329075
- scientific article; zbMATH DE number 782037
- scientific article; zbMATH DE number 3903875
- Convergence of QP-free infeasible methods for nonlinear inequality constrained optimization problems
- Quasi-inexact-Newton methods with global convergence for solving constrained nonlinear systems
Cited in
(45)- Maximizing sum of coupled traces with applications
- Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization
- A new smoothing Newton-type algorithm for semi-infinite programming
- A new active-set strategy for NCP with degenerate solutions
- QP-free method for variational inequality problems
- An active set quasi-Newton method with projection step for monotone nonlinear equations
- An active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations
- Subspace quadratic regularization method for group sparse multinomial logistic regression
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization
- Modified Jacobian smoothing method for nonsmooth complementarity problems
- Active-set projected trust-region algorithm for box-constrained nonsmooth equations
- AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY
- Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions
- Smoothing Newton method for NCP with the identification of degenerate indices
- A projected semismooth Newton method for problems of calibrating least squares covariance matrix
- A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints
- Sequential systems of linear equations method for general constrained optimization without strict complementarity
- The quasi-Newton method of solution of convex variational inequalities with descent decomposition
- Smoothing Levenberg-Marquardt method for general nonlinear complementarity problems under local error bound
- Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation
- Trace ratio optimization with an application to multi-view learning
- Trust-region method for box-constrained semismooth equations and its applications to complementary problems
- A globally convergent method based on Fischer-Burmeister operators for solving second-order cone constrained variational inequality problems
- Robust Euclidean embedding via EDM optimization
- A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences
- A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization
- An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization
- A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization
- Lifting mathematical programs with complementarity constraints
- An eigenvalue-based method for the unbalanced Procrustes problem
- A nonmonotone filter method for nonlinear optimization
- A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search
- A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization
- A quasisecant method for solving a system of nonsmooth equations
- A global QP-free algorithm for mathematical programs with complementarity constraints
- An active-set Levenberg-Marquardt method for degenerate nonlinear complementarity problem under local error bound conditions
- A majorization penalty method for SVM with sparse constraint
- A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization
- A new Levenberg-Marquardt type algorithm for solving nonsmooth constrained equations
- An improved filter method for nonlinear complementarity problem
- Solving a class of variational inequalities with inexact oracle operators
- A null-space-based weightedl1minimization approach to compressed sensing
- Stochastic methods based on Newton method to the stochastic variational inequality problem with constraint conditions
- Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions
- Feasible methods for nonconvex nonsmooth problems with applications in green communications
This page was built for publication: A QP-free constrained Newton-type method for variational inequality problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1295959)
