Pages that link to "Item:Q743777"
From MaRDI portal
The following pages link to A subspace version of the Powell-Yuan trust-region algorithm for equality constrained optimization (Q743777):
Displaying 9 items.
- Subspace choices for the Celis-Dennis-Tapia problem (Q1701260) (← links)
- Two-phase-SQP method with higher-order convergence property (Q2014053) (← links)
- A subspace SQP method for equality constrained optimization (Q2322557) (← links)
- Recent advances in trust region algorithms (Q2349124) (← links)
- On subspace properties of the quadratically constrained quadratic program (Q2411152) (← links)
- An optimal subgradient algorithm with subspace search for costly convex optimization problems (Q2415906) (← links)
- A subspace version of the Wang-Yuan augmented Lagrangian-trust region method for equality constrained optimization (Q2660095) (← links)
- A limited-memory trust-region method for nonlinear optimization with many equality constraints (Q2695671) (← links)
- A local MM subspace method for solving constrained variational problems in image recovery (Q6162148) (← links)