Pages that link to "Item:Q2500511"

The following pages link to Optimization theory and methods. Nonlinear programming (Q2500511):

Displaying 50 items.

• Stable Lévy diffusion and related model fitting (Q2326525) (← links)
• A new hybrid conjugate gradient method for large-scale unconstrained optimization problem with non-convex objective function (Q2327437) (← links)
• Applying Gröbner basis method to multiparametric polynomial nonlinear programming (Q2332342) (← links)
• A modified BFGS type quasi-Newton method with line search for symmetric nonlinear equations problems (Q2332754) (← links)
• An optimal parameter choice for the Dai-Liao family of conjugate gradient methods by avoiding a direction of the maximum magnification by the search direction matrix (Q2336064) (← links)
• A novel self-adaptive trust region algorithm for unconstrained optimization (Q2336586) (← links)
• A new hybrid algorithm for convex nonlinear unconstrained optimization (Q2337034) (← links)
• Limited memory BFGS method based on a high-order tensor model (Q2340525) (← links)
• A self-adjusting conjugate gradient method with sufficient descent condition and conjugacy condition (Q2346398) (← links)
• A modified two steps Levenberg-Marquardt method for nonlinear equations (Q2351083) (← links)
• A wedge trust region method with self-correcting geometry for derivative-free optimization (Q2353471) (← links)
• Structure learning of Bayesian networks using global optimization with applications in data classification (Q2355317) (← links)
• Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update (Q2359995) (← links)
• Computing minimum norm solution of linear systems of equations by the generalized Newton method (Q2360228) (← links)
• A new simple model trust-region method with generalized Barzilai-Borwein parameter for large-scale optimization (Q2360814) (← links)
• A new robust line search technique based on Chebyshev polynomials (Q2378711) (← links)
• Numerical research on the sensitivity of nonmonotone trust region algorithms to their parameters (Q2389479) (← links)
• On the iteratively regularized Gauss-Newton method in Banach spaces with applications to parameter identification problems (Q2391810) (← links)
• Global convergence and the Powell singular function (Q2392109) (← links)
• A preconditioned descent algorithm for variational inequalities of the second kind involving the \(p\)-Laplacian operator (Q2397095) (← links)
• Trace-penalty minimization for large-scale eigenspace computation (Q2398478) (← links)
• A descent extension of the Polak-Ribière-Polyak conjugate gradient method (Q2400710) (← links)
• Robust time-domain output error method for identifying continuous-time systems with time delay (Q2407908) (← links)
• Some iterative methods for the largest positive definite solution to a class of nonlinear matrix equation (Q2413498) (← links)
• Maximum penalized likelihood estimation of additive hazards models with partly interval censoring (Q2416779) (← links)
• Convergence of a stabilized SQP method for equality constrained optimization (Q2419576) (← links)
• A modified descent Polak-Ribiére-Polyak conjugate gradient method with global convergence property for nonconvex functions (Q2424224) (← links)
• A modified trust region method with beale's PCG technique for optimization (Q2427396) (← links)
• Analysis on a superlinearly convergent augmented Lagrangian method (Q2440487) (← links)
• A modified scaled memoryless BFGS preconditioned conjugate gradient method for unconstrained optimization (Q2441364) (← links)
• Local convergence of quasi-Newton methods under metric regularity (Q2450903) (← links)
• An improved inversion-free method for solving the matrix equation \(X + A^\ast X^{-{\alpha}}A = Q\) (Q2453191) (← links)
• Gradient methods for computing the Drazin-inverse solution (Q2453197) (← links)
• An unconstrained optimization method using nonmonotone second order Goldstein's line search (Q2464310) (← links)
• An infeasible interior-point algorithm with full-Newton step for linear optimization (Q2464638) (← links)
• Numerical multilinear algebra and its applications (Q2477577) (← links)
• Successive unconstrained dual optimization method for~rank-one approximation to tensors (Q2510997) (← links)
• An ODE-based nonmonotone method for unconstrained optimization problems (Q2511365) (← links)
• The Dai-Liao nonlinear conjugate gradient method with optimal parameter choices (Q2514763) (← links)
• A parallel line search subspace correction method for composite convex optimization (Q2516372) (← links)
• A new method of moving asymptotes for large-scale unconstrained optimization (Q2518690) (← links)
• A class of descent four-term extension of the Dai-Liao conjugate gradient method based on the scaled memoryless BFGS update (Q2628174) (← links)
• A memory gradient method based on the nonmonotone technique (Q2628189) (← links)
• An efficient inexact Newton-CG algorithm for the smallest enclosing ball problem of large dimensions (Q2630834) (← links)
• Mollifier smoothing of \(C^0\)-Finsler structures (Q2658536) (← links)
• A subspace version of the Wang-Yuan augmented Lagrangian-trust region method for equality constrained optimization (Q2660095) (← links)
• A quasi fractional order gradient descent method with adaptive stepsize and its application in system identification (Q2662614) (← links)
• Two penalized mixed-integer nonlinear programming approaches to tackle multicollinearity and outliers effects in linear regression models (Q2666733) (← links)
• A derivative-free multivariate spectral projection algorithm for constrained nonlinear monotone equations (Q2669864) (← links)
• A modified conjugate gradient method based on the self-scaling memoryless BFGS update (Q2672717) (← links)