Pages that link to "Item:Q2500511"

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

Displaying 50 items.

• A new subspace correction method for nonlinear unconstrained convex optimization problems (Q692728) (← links)
• A filter-line-search method for unconstrained optimization (Q711526) (← links)
• A modified nonmonotone trust region line search method (Q721572) (← links)
• A linear hybridization of the Hestenes-Stiefel method and the memoryless BFGS technique (Q723782) (← links)
• A nonmonotonic trust region algorithm for a class of semi-infinite minimax programming (Q732375) (← links)
• A nonmonotone supermemory gradient algorithm for unconstrained optimization (Q741395) (← links)
• A subspace version of the Powell-Yuan trust-region algorithm for equality constrained optimization (Q743777) (← links)
• Visual MISER: an efficient user-friendly visual program for solving optimal control problems (Q747048) (← links)
• A framework of constraint preserving update schemes for optimization on Stiefel manifold (Q747775) (← links)
• A modified BFGS algorithm based on a hybrid secant equation (Q763667) (← links)
• The research on the properties of Fourier matrix and bent function (Q827579) (← links)
• A type of modified BFGS algorithm with any rank defects and the local \(Q\)-superlinear convergence properties (Q854430) (← links)
• On optimality of the parameters of self-scaling memoryless quasi-Newton updating formulae (Q887119) (← links)
• Optimal radiation fractionation for low-grade gliomas: insights from a mathematical model (Q899208) (← links)
• An accelerated double step size model in unconstrained optimization (Q902839) (← links)
• A dwindling filter line search algorithm for nonlinear equality constrained optimization (Q904938) (← links)
• Application of variable-fidelity models to aerodynamic optimization (Q940087) (← links)
• Optimization design of an explicitly defined rack for the generation of rotors for twin-screw compressors (Q959070) (← links)
• A short note on the Q-linear convergence of the steepest descent method (Q964182) (← links)
• A dimension-reduced method of sensitivity analysis for stochastic user equilibrium assignment model (Q967808) (← links)
• Two new conjugate gradient methods based on modified secant equations (Q972741) (← links)
• A second-order pseudo-transient method for steady-state problems (Q979254) (← links)
• A modified Newton's method for best rank-one approximation to tensors (Q979270) (← links)
• A new method for parameter estimation of edge-preserving regularization in image restoration (Q1006010) (← links)
• Convergence of gradient method for Eelman networks (Q1030289) (← links)
• A filter trust region method for solving semi-infinite programming problems (Q1032551) (← links)
• Nonlinear conjugate gradient methods with sufficient descent condition for large-scale unconstrained optimization (Q1036299) (← links)
• A descent algorithm without line search for unconstrained optimization (Q1044422) (← links)
• On filter-successive linearization methods for nonlinear semidefinite programming (Q1047869) (← links)
• A seminorm regularized alternating least squares algorithm for canonical tensor decomposition (Q1631439) (← links)
• On the global convergence of a projective trust region algorithm for nonlinear equality constrained optimization (Q1633865) (← links)
• Error estimates for the simplified iteratively regularized Gauss-Newton method in Banach spaces under a Morozov-type stopping rule (Q1637466) (← links)
• Numerical treatment of nonlinear MHD Jeffery-Hamel problems using stochastic algorithms (Q1641201) (← links)
• Two accelerated nonmonotone adaptive trust region line search methods (Q1652801) (← links)
• Two extensions of the Dai-Liao method with sufficient descent property based on a penalization scheme (Q1653949) (← links)
• A stochastic level-value estimation method for global optimization (Q1656196) (← links)
• A Barzilai and Borwein scaling conjugate gradient method for unconstrained optimization problems (Q1663393) (← links)
• A double parameter scaled BFGS method for unconstrained optimization (Q1677470) (← links)
• An adaptive three-term conjugate gradient method based on self-scaling memoryless BFGS matrix (Q1677473) (← links)
• A note on the global convergence theorem of accelerated adaptive Perry conjugate gradient methods (Q1677476) (← links)
• A regularized Newton method for computing ground states of Bose-Einstein condensates (Q1685513) (← links)
• Two new Dai-Liao-type conjugate gradient methods for unconstrained optimization problems (Q1686668) (← links)
• On the worst-case evaluation complexity of non-monotone line search algorithms (Q1694392) (← links)
• Cubic interpolation: a line search technique for fuzzy optimization problems (Q1700464) (← links)
• Ensemble preconditioning for Markov chain Monte Carlo simulation (Q1702007) (← links)
• POD/DEIM reduced-order modeling of time-fractional partial differential equations with applications in parameter identification (Q1703057) (← links)
• A structured diagonal Hessian approximation method with evaluation complexity analysis for nonlinear least squares (Q1715713) (← links)
• A modified scaled memoryless BFGS preconditioned conjugate gradient algorithm for nonsmooth convex optimization (Q1716990) (← links)
• Improved optimization methods for image registration problems (Q1717565) (← links)
• Accelerated double direction method for solving unconstrained optimization problems (Q1719483) (← links)