Keywords: 65F22; 65K05; 15A69; 90C30; Alternating least squares; CANDECOMP; PARAFAC; Regularization method; Tensor decomposition;
مقالات ISI (ترجمه نشده)
مقالات زیر هنوز به فارسی ترجمه نشده اند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
در صورتی که به ترجمه آماده هر یک از مقالات زیر نیاز داشته باشید، می توانید سفارش دهید تا مترجمان با تجربه این مجموعه در اسرع وقت آن را برای شما ترجمه نمایند.
Keywords: Semi-Lagrangian method; Error correction method; Extrapolation technique; Nonlinear coupled partial differential equations; Coupled Burger's equations; 35K61; 65M25; 65K05;
Keywords: 90C30; 65K05; 49M37; Unconstrained optimization; Conjugate gradient algorithm; Accelerated scheme; Self-scaling memoryless BFGS update; Convergence analysis;
Keywords: Systems of nonlinear equations; Quasi-Newton methods; Multipoint secant methods; Interpolation methods; Global convergence; Superlinear convergence; 65H10; 65H20; 65K05;
Keywords: Multiextremal functions; Global optimization; Numerical methods; Dimensionality reduction; Convergence; Comparison of efficiency; 65K05; 90C26;
Keywords: 90C59; 90C30; 90C33; 65K05; 49M20; Smoothing function; Concave minimization; Complementarity; Absolute value equation;
Keywords: Constrained global optimization; Numerical comparison; Lipschitz-based deterministic approaches; Nature-inspired metaheuristics; 65K05; 90C26; 65Y20;
Keywords: Optimization; trust region method; global convergence; local convergence; 65K05; 90C26;
Keywords: 90C30; 90B50; 65K05; 62C20; Nonlinear bilevel optimization problem; Active-set strategy; Penalty method; Trust-region; Global convergence;
Keywords: Convex ensemble learning; Incremental subgradient method; Fixed point; Quasi-nonexpansive mapping; 65K05; 68Q32; 90C25;
Keywords: 41A44; 65K05; 90C22; 90C47; Minimal projection; Projection constant; Linear programming; Semidefinite programming; Method of moments;
Keywords: 65K05; 49M37; 90C30; Unconstrained minimization; Primal-dual methods; Ridge regression; Fixed-point methods;
Keywords: 90C30; 90B50; 65K05; 62C20; Optimal load flow; A weighted Tchebychev; An interior point Newton's method; Coleman-Li strategy; Trust region; Projected Hessian;
Keywords: 53B21; 58C05; 58C20; 65D07; 65D10; 65K05; 90C30; Geodesics; Geometric smoothing splines; Least squares; Nonlinear constrained optimization;
Keywords: 49M37; 65K05; 90C30; 90C55; Affine scaling; Derivative-free method; Cubic regularization; Interior point method; Lagrange interpolation;
Keywords: 37N40; 46N10; 49M30; 65K05; 65K10; 90B50; 90C25; Asymptotic control; Convex optimization; Hierarchical minimization; Inertial gradient dynamics; Lyapunov analysis; Weakly coupled wave equations;
Keywords: 28A75; 49Q15; 13P25; 90C22; 90C05; 65C60; 65K05; Computational geometry; Statistics; Probability; Gaussian measure; Moments; Semi-algebraic sets; Semidefinite programming; Semidefinite relaxations;
Keywords: Unconstrained optimization; Conjugate gradient method; Global convergence; 90C30; 65K05;
Keywords: Active set; Penalty method; Interior-point; Coleman-Li strategy; Trust region; Global convergence; 90C30; 90C55; 65K05; 49M37,;
Keywords: 90C33; 65H10; 65K05; Nonlinear complementarity problem; Matrix splitting; Convergence;
Keywords: Nonlinear programming; Trust-region method; Line search; Filter method; Local convergence49M37; 65K05; 90C30; 90C55
Keywords: 65K05; 49M37; 90C30Nonlinear constrained optimization; Exact penalty methods; Bi-object strategy; Global convergence
Keywords: 90C33; 65K05; Jordan spin algebra; P-property; Z-transformations; Positive stable matrix;
Keywords: Constrained optimization; Filter method; Inexact method; Secant method; Maratos effect49M37; 90C30; 65K05
Keywords: Second-order cone complementarity problem; Smoothing Newton method; Tikhonov regularization method; Non-monotone line search90C33; 65K05
Keywords: 65K05; 90C30; 90C56Inexact Restoration; Derivative-free optimization; Trust-region methods; Polynomial interpolation
Keywords: 65K10; 15A80; 65K05; 90C48; 90B35; Idempotent semifield; Eigenvalue; Linear inequality; Optimization problem; Direct solution; Project scheduling;
Keywords: 65K05; 90C30Large scale unconstrained optimization; Simple quadratic model; Nonmonotone trust region method; Global convergence
Keywords: 65K05; 90C53; 49M37; Unconstrained optimization; Scaled nonlinear conjugate gradient method; BFGS update; Modified secant equation; Sufficient descent condition; Global convergence;
Keywords: 15B99; 15B05; 41A29; 49M30; 65F30; 65K05; 65Y20Structured low-rank approximation; Variable projection; Mosaic Hankel matrices; Weighted 2-norm; Fixed elements; Computational complexity
Keywords: 34B15; 34K28; 65K05; Continuous genetic algorithm; System of boundary value problem; Finite difference approximation;
Keywords: 65K05; 90C26; 90C27; 90C59Heuristic algorithms; Biased randomization; Iterated Local Search; Scheduling; Flow-shop; Non-smooth objective functions
On convergence rate of the randomized Kaczmarz method
Keywords: 65F10; 65F20; 65K05; 90C25; 15A06; CR:G1.3; System of linear equations; Randomized Kaczmarz method; Convergence rate;
On the steplength selection in gradient methods for unconstrained optimization
Keywords: Gradient methods; Steplength selection; Hessian spectral properties; 65K05; 90C20; 90C30;
A double parameter scaled BFGS method for unconstrained optimization
Keywords: 49M7; 49M10; 65K05; 90C30; Unconstrained optimization; Scaled BFGS method; Self-correcting quality; Global convergence; Numerical comparisons;
Low Tucker rank tensor recovery via ADMM based on exact and inexact iteratively reweighted algorithms
Keywords: 65K05; 90C26; 90C59; Low Tucker rank tensor recovery; Tensor completion; Alternative direction method of multipliers; Iteratively reweighted algorithms; Lp norm;
Convergence of damped inertial dynamics governed by regularized maximally monotone operators
Keywords: 37N40; 46N10; 49M30; 65K05; 65K10; 90C25; Asymptotic stabilization; Damped inertial dynamics; Lyapunov analysis; Maximally monotone operators; Time-dependent viscosity; Yosida regularization;
On preconditioned and relaxed AVMM methods for quadratic programming problems with equality constraints
Keywords: 65F08; 65F10; 65K05; 90C20; 90C25; Equality-constraint quadratic programming problem; Iteration method; Successive relaxation; Preconditioning; Asymptotic convergence;
Accelerated adaptive Perry conjugate gradient algorithms based on the self-scaling memoryless BFGS update
Keywords: 49M07; 49M10; 65K05; 90C06; Unconstrained optimization; Conjugate gradient algorithms; Self-scaling memoryless BFGS update; Sufficient descent condition; Conjugacy condition; Frobenius norm;
Asymptotic stabilization of inertial gradient dynamics with time-dependent viscosity
Keywords: 37N40; 46N10; 49M30; 65K05; 65K10; 90B50; 90C25; Asymptotic stabilization; Convex optimization; Inertial gradient dynamics; Fast gradient method; Lyapunov analysis; Vanishing viscosity;
An optimistic robust optimization approach to common set of weights in DEA
Keywords: 65K05; 90C05; 90B50; Data envelopment analysis; Common weights; Robust optimization; Interval uncertainty;
An inexact derivative-free Levenberg–Marquardt method for linear inequality constrained nonlinear systems under local error bound conditions
Keywords: Derivative-free optimization; Levenberg–Marquardt method; Inexact; System of nonlinear equations; Interior point; Affine scaling49M37; 65K05; 90C30; 90C56
A PRP-based residual method for large-scale monotone nonlinear equations
Keywords: PRP-based method; Monotone nonlinear equations; Nonsmooth; Global convergence; 90C30; 65K05;
A modified Polak-Ribière-Polyak conjugate gradient algorithm for nonsmooth convex programs
Keywords: 90C52; 65K05; 90C30; Nonsmooth convex optimization; Conjugate gradient method; Nonmonotone line search; Global convergence;
A reweighted nuclear norm minimization algorithm for low rank matrix recovery
Keywords: 65K05; 90C59; 15A60; Low rank matrix minimization; Matrix completion problem; Reweighted nuclear norm minimization; Weighted fixed point method;
An inexact and nonmonotone proximal method for smooth unconstrained minimization
Keywords: 49M37; 65K05; 90C30Proximal point algorithms; Nonconvex problems; Unconstrained minimization; Global convergence; Nonmonotone line search; Numerical experiments
On a self-consistent-field-like iteration for maximizing the sum of the Rayleigh quotients
Keywords: 65F15; 65K05; 65F30; 15A18Rayleigh quotient; The nonlinear eigenvalue problem; The self-consistent-field iteration; Trust region
Aggregate codifferential method for nonsmooth DC optimization
Keywords: 65K05; 90C25; Nonsmooth optimization; DC programming; Subdifferential; Codifferential;
On the convergence of the modified Levenberg–Marquardt method with a nonmonotone second order Armijo type line search
Keywords: 65K05; 90C30Nonlinear equations; Line search; Global convergence; Cubic convergence
On the convergence of a modified regularized Newton method for convex optimization with singular solutions
Keywords: 65K05; 90C30Convex optimization; Newton method; Global convergence; Cubic convergence