Pages that link to "Item:Q3890450"
From MaRDI portal
The following pages link to Newton’s Method and the Goldstein Step-Length Rule for Constrained Minimization Problems (Q3890450):
Displaying 15 items.
- Rates of convergence for adaptive Newton methods (Q802470) (← links)
- Finite convergence of algorithms for nonlinear programs and variational inequalities (Q809897) (← links)
- The modified barrier function method for linear programming and its extensions (Q918138) (← links)
- Extremal types for certain \(L^ p \)minimization problems and associated large scale nonlinear programs (Q1051891) (← links)
- A class of superlinearly convergent projection algorithms with relaxed stepsizes (Q1057626) (← links)
- Newton's method for singular constrained optimization problems (Q1057627) (← links)
- Convergent stepsizes for constrained optimization algorithms (Q1061005) (← links)
- A projected Newton method for minimization problems with nonlinear inequality constraints (Q1095798) (← links)
- Variable metric gradient projection processes in convex feasible sets defined by nonlinear inequalities (Q1101344) (← links)
- Superlinear convergence of a trust region type successive linear programming method (Q1102881) (← links)
- An algorithm for discrete linear \(L_ p\) approximation (Q1153653) (← links)
- Solving variational inequality and fixed point problems by line searches and potential optimization (Q1764238) (← links)
- On the convergence of projected gradient processes to singular critical points (Q1821692) (← links)
- Newton-Goldstein convergence rates for convex constrained minimization problems with singular solutions (Q2266355) (← links)
- Convergence of algorithms for perturbed optimization problems (Q2641227) (← links)
