Pages that link to "Item:Q1893505"

The following pages link to On the convergence of a new trust region algorithm (Q1893505):

Displaying 33 items.

• An interior-point penalty active-set trust-region algorithm (Q334604) (← links)
• A hybrid algorithm for linearly constrained minimax problems (Q363595) (← links)
• Nonmonotone algorithm for minimax optimization problems (Q632859) (← links)
• A new semi-penalty method for nonlinear programming (Q702565) (← links)
• A primal-dual interior-point method capable of rapidly detecting infeasibility for nonlinear programs (Q781112) (← links)
• Nonmonotone trust-region method for nonlinear programming with general constraints and simple bounds (Q852152) (← links)
• Sequential penalty quadratic programming filter methods for nonlinear programming (Q864206) (← links)
• A global convergence theory for an active-trust-region algorithm for solving the general nonlinear programing problem. (Q1398662) (← links)
• A penalty method with trust-region mechanism for nonlinear bilevel optimization problem (Q1636776) (← links)
• A derivative-free filter method for solving nonlinear complementarity problems (Q1764731) (← links)
• A new augmented Lagrangian method for equality constrained optimization with simple unconstrained subproblem (Q1784887) (← links)
• Global convergence of trust region algorithm for equality and bound constrained nonlinear optimization (Q1812223) (← links)
• A comparative study of SQP-type algorithms for nonlinear and nonconvex mixed-integer optimization (Q1946925) (← links)
• A hybrid algorithm for nonlinear minimax problems (Q2271823) (← links)
• Recent advances in trust region algorithms (Q2349124) (← links)
• A variant of SQP method for inequality constrained optimization and its global convergence (Q2432728) (← links)
• A multiplier active-set trust-region algorithm for solving constrained optimization problem (Q2449200) (← links)
• A new penalty method for nonlinear programming (Q2458508) (← links)
• A trust region SQP algorithm for mixed-integer nonlinear programming (Q2463830) (← links)
• Parameter optimization using the \(L_\infty \) exact penalty function and strictly convex quadratic programming problems (Q2483248) (← links)
• A trust region filter method for general non-linear programming (Q2489398) (← links)
• A robust SQP method for mathematical programs with linear complementarity constraints (Q2506190) (← links)
• A variant of trust-region methods for unconstrained optimization (Q2518723) (← links)
• A filter method for solving nonlinear complementarity problems (Q2570745) (← links)
• An augmented Lagrangian trust region method for equality constrained optimization (Q2943835) (← links)
• An augmented Lagrangian affine scaling method for nonlinear programming (Q3458825) (← links)
• Steering exact penalty methods for nonlinear programming (Q3539789) (← links)
• The solution of euclidean norm trust region SQP subproblems via second-order cone programs: an overview and elementary introduction (Q4638912) (← links)
• Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity (Q5000647) (← links)
• A new SQP approach for nonlinear complementarity problems (Q5190727) (← links)
• A globally convergent primal-dual interior-point relaxation method for nonlinear programs (Q5216730) (← links)
• A novel augmented Lagrangian method of multipliers for optimization with general inequality constraints (Q5879119) (← links)
• Tikhonov regularization for a general nonlinear constrained optimization problem (Q6123106) (← links)