Pages that link to "Item:Q457205"
From MaRDI portal
The following pages link to Interior-point methods for nonconvex nonlinear programming: cubic regularization (Q457205):
Displaying 12 items.
- An inexact proximal regularization method for unconstrained optimization (Q522090) (← links)
- Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization (Q746819) (← links)
- Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts (Q953208) (← links)
- Cubic regularization in symmetric rank-1 quasi-Newton methods (Q1741108) (← links)
- Nonlinear least square based on control direction by dual method and its application (Q1793495) (← links)
- New subspace minimization conjugate gradient methods based on regularization model for unconstrained optimization (Q2041515) (← links)
- On global minimizers of quadratic functions with cubic regularization (Q2329649) (← links)
- On the use of iterative methods in cubic regularization for unconstrained optimization (Q2515064) (← links)
- A sequential adaptive regularisation using cubics algorithm for solving nonlinear equality constrained optimization (Q2696932) (← links)
- A cubic regularization algorithm for unconstrained optimization using line search and nonmonotone techniques (Q2829572) (← links)
- An improvement of adaptive cubic regularization method for unconstrained optimization problems (Q5031220) (← links)
- Two modified adaptive cubic regularization algorithms by using the nonmonotone Armijo-type line search (Q6062861) (← links)
