Pages that link to "Item:Q1295959"
From MaRDI portal
The following pages link to A QP-free constrained Newton-type method for variational inequality problems (Q1295959):
Displaying 45 items.
- A new active-set strategy for NCP with degenerate solutions (Q273257) (← links)
- An active-set Levenberg-Marquardt method for degenerate nonlinear complementarity problem under local error bound conditions (Q330373) (← links)
- An improved filter method for nonlinear complementarity problem (Q473668) (← links)
- An inexact Newton method for stationary points of mathematical programs constrained by parameterized quasi-variational inequalities (Q494664) (← links)
- A quasisecant method for solving a system of nonsmooth equations (Q524563) (← links)
- A new Levenberg-Marquardt type algorithm for solving nonsmooth constrained equations (Q530014) (← links)
- Smoothing Levenberg-Marquardt method for general nonlinear complementarity problems under local error bound (Q534917) (← links)
- Sequential systems of linear equations method for general constrained optimization without strict complementarity (Q557781) (← links)
- Local feasible QP-free algorithms for the constrained minimization of SC\(^1\) functions (Q597172) (← links)
- Lifting mathematical programs with complementarity constraints (Q662308) (← links)
- A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization (Q669396) (← links)
- A nonmonotone filter method for nonlinear optimization (Q694518) (← links)
- Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization (Q700746) (← links)
- Active-set projected trust-region algorithm for box-constrained nonsmooth equations (Q704744) (← links)
- A new smoothing Newton-type algorithm for semi-infinite programming (Q969747) (← links)
- A smoothing-type algorithm for solving nonlinear complementarity problems with a non-monotone line search (Q979319) (← links)
- A globally convergent method based on Fischer-Burmeister operators for solving second-order cone constrained variational inequality problems (Q979810) (← links)
- A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization (Q979866) (← links)
- A new feasible descent primal-dual interior point algorithm for nonlinear inequality constrained optimization (Q988435) (← links)
- Smoothing Newton method for NCP with the identification of degenerate indices (Q989148) (← links)
- Solving a class of variational inequalities with inexact oracle operators (Q992039) (← links)
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization (Q1004010) (← links)
- The quasi-Newton method of solution of convex variational inequalities with descent decomposition (Q1570271) (← links)
- A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints (Q1675425) (← links)
- A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization (Q1740436) (← links)
- Smoothing trust region methods for nonlinear complementarity problems with \(P_0\)-functions (Q1772966) (← links)
- Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation (Q1827220) (← links)
- Stochastic methods based on Newton method to the stochastic variational inequality problem with constraint conditions (Q1930995) (← links)
- Subspace quadratic regularization method for group sparse multinomial logistic regression (Q2044487) (← links)
- A global QP-free algorithm for mathematical programs with complementarity constraints (Q2069554) (← links)
- Maximizing sum of coupled traces with applications (Q2095802) (← links)
- An active set quasi-Newton method with projection step for monotone nonlinear equations (Q2144849) (← links)
- Robust Euclidean embedding via EDM optimization (Q2220896) (← links)
- A superlinearly convergent SQP method without boundedness assumptions on any of the iterative sequences (Q2252398) (← links)
- A projected semismooth Newton method for problems of calibrating least squares covariance matrix (Q2275573) (← links)
- Modified Jacobian smoothing method for nonsmooth complementarity problems (Q2301134) (← links)
- Feasible methods for nonconvex nonsmooth problems with applications in green communications (Q2364485) (← links)
- An active-set projected trust-region algorithm with limited memory BFGS technique for box-constrained nonsmooth equations (Q2868903) (← links)
- An infeasible QP-free algorithm without a penalty function or a filter for nonlinear inequality-constrained optimization (Q2926081) (← links)
- AN INFEASIBLE SSLE FILTER ALGORITHM FOR GENERAL CONSTRAINED OPTIMIZATION WITHOUT STRICT COMPLEMENTARITY (Q3013564) (← links)
- A null-space-based weighted<i>l</i><sub>1</sub>minimization approach to compressed sensing (Q4603732) (← links)
- Trust-region method for box-constrained semismooth equations and its applications to complementary problems (Q4902845) (← links)
- An Eigenvalue-Based Method for the Unbalanced Procrustes Problem (Q5853715) (← links)
- Trace ratio optimization with an application to multi-view learning (Q6165582) (← links)
- A majorization penalty method for SVM with sparse constraint (Q6175561) (← links)
