Pages that link to "Item:Q2494514"

The following pages link to Interior-point \(\ell_2\)-penalty methods for nonlinear programming with strong global convergence properties (Q2494514):

Displaying 24 items.

• A stabilized filter SQP algorithm for nonlinear programming (Q312472) (← links)
• A line search exact penalty method using steering rules (Q431002) (← links)
• Study of a primal-dual algorithm for equality constrained minimization (Q480924) (← links)
• Structured regularization for barrier NLP solvers (Q523568) (← links)
• Ergodic, primal convergence in dual subgradient schemes for convex programming. II: The case of inconsistent primal problems (Q526828) (← links)
• An interior-point piecewise linear penalty method for nonlinear programming (Q543401) (← links)
• A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs (Q781112) (← links)
• An interior-point \(\ell_{\frac{1}{2}}\)-penalty method for inequality constrained nonlinear optimization (Q898716) (← links)
• An approximate strong KKT condition for multiobjective optimization (Q1617113) (← links)
• A second-order optimality condition with first- and second-order complementarity associated with global convergence of algorithms (Q1639726) (← links)
• A primal-dual augmented Lagrangian penalty-interior-point filter line search algorithm (Q1650852) (← links)
• Uniform boundedness of the inverse of a Jacobian matrix arising in regularized interior-point methods (Q1942268) (← links)
• A null-space primal-dual interior-point algorithm for nonlinear optimization with nice convergence properties (Q1960196) (← links)
• On the solution of linearly constrained optimization problems by means of barrier algorithms (Q1979175) (← links)
• A primal-dual interior-point relaxation method with global and rapidly local convergence for nonlinear programs (Q2105288) (← links)
• On the behavior of Lagrange multipliers in convex and nonconvex infeasible interior point methods (Q2227537) (← links)
• A mixed logarithmic barrier-augmented Lagrangian method for nonlinear optimization (Q2363570) (← links)
• A penalty-interior-point algorithm for nonlinear constrained optimization (Q2392661) (← links)
• On the augmented subproblems within sequential methods for nonlinear programming (Q2403109) (← links)
• A new class of exact penalty functions and penalty algorithms (Q2442639) (← links)
• A globally convergent primal-dual interior-point relaxation method for nonlinear programs (Q5216730) (← links)
• Strict Constraint Qualifications and Sequential Optimality Conditions for Constrained Optimization (Q5219665) (← links)
• On Optimality Conditions for Nonlinear Conic Programming (Q5868952) (← links)
• A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints (Q5879119) (← links)