Pages that link to "Item:Q2337587"
From MaRDI portal
The following pages link to Evaluation complexity bounds for smooth constrained nonlinear optimization using scaled KKT conditions and high-order models (Q2337587):
Displayed 7 items.
- An active set trust-region method for bound-constrained optimization (Q2169274) (← links)
- Optimality condition and complexity analysis for linearly-constrained optimization without differentiability on the boundary (Q2330649) (← links)
- Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems (Q2419539) (← links)
- On Regularization and Active-set Methods with Complexity for Constrained Optimization (Q4641664) (← links)
- Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity (Q5000647) (← links)
- Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization (Q6113530) (← links)
- A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees (Q6116250) (← links)