Pages that link to "Item:Q2866197"
From MaRDI portal
The following pages link to On the Evaluation Complexity of Cubic Regularization Methods for Potentially Rank-Deficient Nonlinear Least-Squares Problems and Its Relevance to Constrained Nonlinear Optimization (Q2866197):
Displaying 23 items.
- Corrigendum to: ``On the complexity of finding first-order critical points in constrained nonlinear optimization'' (Q507344) (← links)
- Separable cubic modeling and a trust-region strategy for unconstrained minimization with impact in global optimization (Q746819) (← links)
- A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares (Q1715713) (← links)
- Second-order optimality and beyond: characterization and evaluation complexity in convexly constrained nonlinear optimization (Q1785005) (← links)
- Approximately normalized iterative hard thresholding for nonlinear compressive sensing (Q1792868) (← links)
- Complexity of proximal augmented Lagrangian for nonconvex optimization with nonlinear equality constraints (Q1995981) (← links)
- Optimality of orders one to three and beyond: characterization and evaluation complexity in constrained nonconvex optimization (Q2001208) (← links)
- A derivative-free trust-region algorithm for composite nonsmooth optimization (Q2013620) (← links)
- A brief survey of methods for solving nonlinear least-squares problems (Q2273095) (← links)
- Convergence and evaluation-complexity analysis of a regularized tensor-Newton method for solving nonlinear least-squares problems (Q2419539) (← links)
- Evaluation Complexity for Nonlinear Constrained Optimization Using Unscaled KKT Conditions and High-Order Models (Q2802144) (← links)
- Complexity Analysis of a Trust Funnel Algorithm for Equality Constrained Optimization (Q4641670) (← links)
- Ghost Penalties in Nonconvex Constrained Optimization: Diminishing Stepsizes and Iteration Complexity (Q5000647) (← links)
- On the complexity of solving feasibility problems with regularized models (Q5038424) (← links)
- Error bound conditions and convergence of optimization methods on smooth and proximally smooth manifolds (Q5070619) (← links)
- A Stochastic Levenberg--Marquardt Method Using Random Models with Complexity Results (Q5075237) (← links)
- A Trust Region Method for Finding Second-Order Stationarity in Linearly Constrained Nonconvex Optimization (Q5124006) (← links)
- Stochastic Conditional Gradient++: (Non)Convex Minimization and Continuous Submodular Maximization (Q5148398) (← links)
- (Q5214226) (← links)
- On the Evaluation Complexity of Constrained Nonlinear Least-Squares and General Constrained Nonlinear Optimization Using Second-Order Methods (Q5253577) (← links)
- Regularized Newton Methods for Minimizing Functions with Hölder Continuous Hessians (Q5737717) (← links)
- Regularized Newton Method with Global \({\boldsymbol{\mathcal{O}(1/{k}^2)}}\) Convergence (Q6116237) (← links)
- A Newton-CG Based Augmented Lagrangian Method for Finding a Second-Order Stationary Point of Nonconvex Equality Constrained Optimization with Complexity Guarantees (Q6116250) (← links)