Pages that link to "Item:Q1928747"
From MaRDI portal
The following pages link to Evaluating bound-constrained minimization software (Q1928747):
Displaying 12 items.
- An active-set projected trust region algorithm for box constrained optimization problems (Q905153) (← links)
- On the construction of quadratic models for derivative-free trust-region algorithms (Q1688943) (← links)
- An active set feasible method for large-scale minimization problems with bound constraints (Q1928749) (← links)
- On the use of third-order models with fourth-order regularization for unconstrained optimization (Q2182770) (← links)
- Algebraic rules for quadratic regularization of Newton's method (Q2340522) (← links)
- A two-stage active-set algorithm for bound-constrained optimization (Q2359771) (← links)
- Algebraic rules for computing the regularization parameter of the Levenberg-Marquardt method (Q2374367) (← links)
- A Newton-like method with mixed factorizations and cubic regularization for unconstrained minimization (Q2419564) (← links)
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables (Q3788978) (← links)
- On Regularization and Active-set Methods with Complexity for Constrained Optimization (Q4641664) (← links)
- The Use of Quadratic Regularization with a Cubic Descent Condition for Unconstrained Optimization (Q5266534) (← links)
- A BFGS-SQP method for nonsmooth, nonconvex, constrained optimization and its evaluation using relative minimization profiles (Q5268896) (← links)
