Pages that link to "Item:Q4717557"
From MaRDI portal
The following pages link to Convergence Properties of Minimization Algorithms for Convex Constraints Using a Structured Trust Region (Q4717557):
Displaying 12 items.
- An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints (Q461441) (← links)
- Local search proximal algorithms as decision dynamics with costs to move (Q632228) (← links)
- Global convergence of trust-region algorithms for convex constrained minimization without derivatives (Q902511) (← links)
- Recent progress in unconstrained nonlinear optimization without derivatives (Q1365064) (← links)
- Numerical experiments with the Lancelot package (Release \(A\)) for large-scale nonlinear optimization (Q1915809) (← links)
- High-order evaluation complexity for convexly-constrained optimization with non-Lipschitzian group sparsity terms (Q2020600) (← links)
- A trust-region framework for real-time optimization with structural process-model mismatch (Q2022387) (← links)
- A matrix-free trust-region Newton algorithm for convex-constrained optimization (Q2119752) (← links)
- (Q3840623) (← links)
- Complexity of Partially Separable Convexly Constrained Optimization with Non-Lipschitzian Singularities (Q4634141) (← links)
- Optimizing partially separable functions without derivatives (Q5717536) (← links)
- Efficient proximal subproblem solvers for a nonsmooth trust-region method (Q6667695) (← links)
