Pages that link to "Item:Q4229470"
From MaRDI portal
The following pages link to On the Accurate Identification of Active Constraints (Q4229470):
Displayed 50 items.
- Active-set prediction for interior point methods using controlled perturbations (Q263153) (← links)
- 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)
- Solving the general quadratic programming problem in a finite number of steps (Q382174) (← links)
- Convergence analysis of a regularized interior point algorithm for the barrier problems with singular solutions (Q393377) (← links)
- An LP-Newton method: nonsmooth equations, KKT systems, and nonisolated solutions (Q403631) (← links)
- On regularity conditions for complementarity problems (Q404520) (← links)
- Dual convergence for penalty algorithms in convex programming (Q430935) (← links)
- Stabilized SQP revisited (Q431014) (← links)
- Sequential quadratic programming methods for parametric nonlinear optimization (Q480928) (← links)
- A variable fixing version of the two-block nonlinear constrained Gauss-Seidel algorithm for \(\ell_1\)-regularized least-squares (Q480935) (← links)
- Superlinearly convergent norm-relaxed SQP method based on active set identification and new line search for constrained minimax problems (Q481052) (← links)
- A generalized gradient projection method based on a new working set for minimax optimization problems with inequality constraints (Q515950) (← links)
- A stabilized SQP method: superlinear convergence (Q526843) (← links)
- On the accurate identification of active set for constrained minimax problems (Q531696) (← links)
- Primal-dual interior-point method for thermodynamic gas-particle partitioning (Q538298) (← links)
- An accurate active set Newton algorithm for large scale bound constrained optimization. (Q548593) (← links)
- Solving equations via the trust region and its application to a class of stochastic linear complementarity problems (Q552359) (← 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)
- An active set strategy based on the multiplier function or the gradient. (Q622855) (← links)
- A new sequential systems of linear equations algorithm of feasible descent for inequality constrained optimization (Q627582) (← links)
- A superlinearly convergent method of quasi-strongly sub-feasible directions with active set identifying for constrained optimization (Q635233) (← links)
- Modified active set projected spectral gradient method for bound constrained optimization (Q638841) (← links)
- Partial projected Newton method for a class of stochastic linear complementarity problems (Q652329) (← links)
- A working set SQCQP algorithm with simple nonmonotone penalty parameters (Q654747) (← links)
- A strongly sub-feasible primal-dual quasi interior-point algorithm for nonlinear inequality constrained optimization (Q669396) (← links)
- New active set identification for general constrained optimization and minimax problems (Q743206) (← links)
- An active-set algorithmic framework for non-convex optimization problems over the simplex (Q782910) (← links)
- A modified SQP algorithm for minimax problems (Q837129) (← links)
- An inexact-restoration method for nonlinear bilevel programming problems (Q839690) (← links)
- Examples of dual behaviour of Newton-type methods on optimization problems with degenerate constraints (Q842762) (← links)
- A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming (Q853883) (← links)
- On affine-scaling interior-point Newton methods for nonlinear minimization with bound constraints (Q853889) (← links)
- Primal-dual interior-point method for an optimization problem related to the modeling of atmospheric organic aerosols (Q868558) (← links)
- Generalized Nash equilibrium problems and Newton methods (Q959968) (← links)
- A coordinate gradient descent method for nonsmooth separable minimization (Q959979) (← links)
- A feasible QP-free algorithm combining the interior-point method with active set for constrained optimization (Q979866) (← links)
- An active set quasi-Newton method with projected search for bound constrained minimization (Q980100) (← 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)
- An inequality constrained nonlinear Kalman-Bucy smoother by interior point likelihood maximization (Q1000785) (← links)
- A superlinearly convergent strongly sub-feasible SSLE-type algorithm with working set for nonlinearly constrained optimization (Q1004010) (← links)
- Conjugate gradient method for the linear complementarity problem withs-matrix (Q1007676) (← links)
- Error bounds in mathematical programming (Q1365060) (← links)
- A new class of nonmonotone adaptive trust-region methods for nonlinear equations with box constraints (Q1675425) (← links)
- A globally convergent LP-Newton method for piecewise smooth constrained equations: escaping nonstationary accumulation points (Q1744883) (← links)
- Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs (Q1765864) (← links)
- Local convergence analysis of projection-type algorithms: unified approach (Q1810933) (← links)
- Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation (Q1827220) (← links)