A QP-free constrained Newton-type method for variational inequality problems
From MaRDI portal
Publication:1295959
DOI10.1007/s101070050047zbMath0958.65078OpenAlexW2046272803MaRDI QIDQ1295959
Publication date: 28 June 1999
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070050047
algorithmglobal convergenceNewton's methodvariational inequalityquadratic convergencestrong regularitysemismoothness
Numerical optimization and variational techniques (65K10) Variational inequalities (49J40) Newton-type methods (49M15)
Related Items
A new active-set strategy for NCP with degenerate solutions, Feasible methods for nonconvex nonsmooth problems with applications in green communications, An active set quasi-Newton method with projection step for monotone nonlinear equations, An active-set Levenberg-Marquardt method for degenerate nonlinear complementarity problem under local error bound conditions, An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization, Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions, A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints, Stochastic methods based on Newton method to the stochastic variational inequality problem with constraint conditions, Trace ratio optimization with an application to multi-view learning, A majorization penalty method for SVM with sparse constraint, A null-space-based weightedl1minimization approach to compressed sensing, Robust Euclidean embedding via EDM optimization, An improved filter method for nonlinear complementarity problem, Lifting mathematical programs with complementarity constraints, A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization, A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization, Trust-region method for box-constrained semismooth equations and its applications to complementary problems, AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY, A quasisecant method for solving a system of nonsmooth equations, A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences, A new Levenberg-Marquardt type algorithm for solving nonsmooth constrained equations, A nonmonotone filter method for nonlinear optimization, Smoothing Levenberg-Marquardt method for general nonlinear complementarity problems under local error bound, A new smoothing Newton-type algorithm for semi-infinite programming, Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization, Active-set projected trust-region algorithm for box-constrained nonsmooth equations, Sequential systems of linear equations method for general constrained optimization without strict complementarity, Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions, A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search, A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization, A projected semismooth Newton method for problems of calibrating least squares covariance matrix, A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization, Smoothing Newton method for NCP with the identification of degenerate indices, Solving a class of variational inequalities with inexact oracle operators, A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization, Subspace quadratic regularization method for group sparse multinomial logistic regression, Modified Jacobian smoothing method for nonsmooth complementarity problems, A global QP-free algorithm for mathematical programs with complementarity constraints, Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation, An Eigenvalue-Based Method for the Unbalanced Procrustes Problem, Maximizing sum of coupled traces with applications, An active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations
Uses Software
