Pages that link to "Item:Q4641664"
From MaRDI portal
The following pages link to On Regularization and Active-set Methods with Complexity for Constrained Optimization (Q4641664):
Displaying 12 items.
- On large-scale unconstrained optimization and arbitrary regularization (Q2070329) (← links)
- On complexity and convergence of high-order coordinate descent algorithms for smooth nonconvex box-constrained minimization (Q2089862) (← links)
- Block coordinate descent for smooth nonconvex constrained minimization (Q2162523) (← links)
- On constrained optimization with nonconvex regularization (Q2225521) (← links)
- A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization (Q2419564) (← links)
- A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization (Q2696932) (← links)
- A Trust Region Method for Finding Second-Order Stationarity in Linearly Constrained Nonconvex Optimization (Q5124006) (← links)
- On the Complexity of an Inexact Restoration Method for Constrained Optimization (Q5210514) (← links)
- Iteration and evaluation complexity for the minimization of functions whose computation is intrinsically inexact (Q5235099) (← links)
- Complexity and performance of an Augmented Lagrangian algorithm (Q5858985) (← links)
- A filter sequential adaptive cubic regularization algorithm for nonlinear constrained optimization (Q6109884) (← links)
- Worst-case evaluation complexity of a quadratic penalty method for nonconvex optimization (Q6113530) (← links)
