Pages that link to "Item:Q1897451"

The following pages link to Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems (Q1897451):

Displaying 50 items.

• A fast convergent sequential linear equation method for inequality constrained optimization without strict complementarity (Q273251) (← links)
• An improved interior-type feasible QP-free algorithm for inequality constrained optimization problems (Q437832) (← links)
• An improved strongly sub-feasible SSLE method for optimization problems and numerical experiments (Q531641) (← links)
• An accurate active set Newton algorithm for large scale bound constrained optimization. (Q548593) (← links)
• A modified QP-free feasible method (Q552398) (← 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)
• Modified active set projected spectral gradient method for bound constrained optimization (Q638841) (← links)
• A working set SQCQP algorithm with simple nonmonotone penalty parameters (Q654747) (← links)
• Global and local convergence of a class of penalty-free-type methods for nonlinear programming (Q693410) (← links)
• A nonmonotone filter method for nonlinear optimization (Q694518) (← links)
• Globally and superlinearly convergent QP-free algorithm for nonlinear constrained optimization (Q700746) (← links)
• An active-set algorithmic framework for non-convex optimization problems over the simplex (Q782910) (← links)
• A superlinearly convergent norm-relaxed SQP method of strongly sub-feasible directions for constrained optimization without strict complementarity (Q833162) (← links)
• An efficient feasible SQP algorithm for inequality constrained optimization (Q837710) (← links)
• A type of efficient feasible SQP algorithms for inequality constrained optimization (Q846474) (← links)
• A simple feasible SQP method for inequality constrained optimization with global and superlinear convergence (Q848564) (← links)
• A simple feasible SQP algorithm for inequality constrained optimization (Q858743) (← links)
• A globally and superlinearly convergent modified SQP-filter method (Q933797) (← links)
• Convergence rates of a multilevel method for the regularization of nonlinear ill-posed problems (Q935182) (← links)
• An interior point type QP-free algorithm with superlinear convergence for inequality constrained optimization (Q938022) (← 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)
• A penalty-function-free line search SQP method for nonlinear programming (Q1019803) (← links)
• An improved SQP algorithm for solving minimax problems (Q1021864) (← links)
• An SQP algorithm for mathematical programs with nonlinear complementarity constraints (Q1030407) (← links)
• Robust recursive quadratic programming algorithm model with global and superlinear convergence properties (Q1356094) (← links)
• A new SQP method of feasible directions for nonlinear programming. (Q1415268) (← links)
• A feasible and superlinear algorithm for inequality constrained minimization problems (Q1568229) (← links)
• A mixed superlinearly convergent algorithm with nonmonotone search for constrained optimizations (Q1576323) (← links)
• A QP-free algorithm without a penalty function or a filter for nonlinear general-constrained optimization (Q1740436) (← links)
• An efficient sequential quadratic programming algorithm for nonlinear programming (Q1765487) (← links)
• A new feasible descent algorithm combining SQP with generalized projection for optimization problems without strict complementarity (Q1765848) (← links)
• Globally and superlinearly convergent algorithms for the solution of box-constrained optimi\-zation (Q1827220) (← links)
• A superlinearly convergent numerical algorithm for nonlinear programming (Q1926210) (← links)
• An improved feasible QP-free algorithm for inequality constrained optimization (Q1941312) (← links)
• A truly variationally consistent and symmetric mortar-based contact formulation for finite deformation solid mechanics (Q1986409) (← links)
• A decomposition method for Lasso problems with zero-sum constraint (Q2106751) (← links)
• An augmented Lagrangian method exploiting an active-set strategy and second-order information (Q2139257) (← links)
• A feasible SQP method for nonlinear programming (Q2266975) (← links)
• A two-stage active-set algorithm for bound-constrained optimization (Q2359771) (← links)
• A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints (Q2369090) (← links)
• A truncated Newton method in an augmented Lagrangian framework for nonlinear programming (Q2379687) (← links)
• A sequential equality constrained quadratic programming algorithm for inequality constrained optimization (Q2475402) (← links)
• A sequential quadratically constrained quadratic programming method of feasible directions (Q2480785) (← links)
• An SQP feasible descent algorithm for nonlinear inequality constrained optimization without strict complementarity (Q2485397) (← links)
• A kind of QP-free feasible method (Q2519715) (← links)
• A globally and superlinearly convergent feasible QP-free method for nonlinear programming (Q2572703) (← links)
• A fast active set block coordinate descent algorithm for \(\ell_1\)-regularized least squares (Q2796799) (← links)