Suchergebnisse - "numerical mathematical programming methods"

A revised MRMIL Riemannian conjugate gradient method with simplified global convergence properties

Autoren: Nasiru Salihu Poom Kumam Sani Salisu et al.

Quelle: Applied Numerical Mathematics. 214:110-126

Schlagwörter: global convergence, Numerical mathematical programming methods, vector transport, Nonlinear programming, conjugate gradient method, Riemannian optimization, Riemannian Wolfe conditions, retraction

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/8034927
https://doi.org/10.1016/j.apnum.2025.03.007

Design Guidelines for Noise-Tolerant Optimization with Applications in Robust Design: Design guidelines for noise-tolerant optimization with applications in robust design

Autoren: Lou, Yuchen Sun, Shigeng Nocedal, Jorge

Quelle: SIAM Journal on Scientific Computing. 47:A1335-A1357

Schlagwörter: 0211 other engineering and technologies, Stochastic programming, 02 engineering and technology, Numerical Analysis (math.NA), stochastic optimization, nonlinear optimization, 01 natural sciences, Design techniques (robust design, computer-aided design, etc.), Numerical mathematical programming methods, Nonlinear programming, Optimization and Control (math.OC), FOS: Mathematics, 90C30, 90C15, 93B51, 65K05, noise estimation, Mathematics - Numerical Analysis, 0101 mathematics, Mathematics - Optimization and Control

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/abs/2401.15007

Accelerated gradient methods on the Grassmann and Stiefel manifolds

Autoren: Xiaojing Zhu

Quelle: Japan Journal of Industrial and Applied Mathematics. 42:751-786

Schlagwörter: Programming in abstract spaces, Stiefel manifold, Numerical mathematical programming methods, Nonlinear programming, accelerated gradient, global rate of convergence, Riemannian optimization, Abstract computational complexity for mathematical programming problems, Nonconvex programming, global optimization, Grassmann manifold

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/8037191
https://doi.org/10.1007/s13160-025-00692-8

Convergence of a stochastic variance reduced Levenberg–Marquardt method: Convergence of a stochastic variance reduced Levenberg-Marquardt method

Autoren: Shao, Weiyi Fan, Jinyan

Quelle: Computational Optimization and Applications. 90:417-444

Schlagwörter: least squares problems, Numerical mathematical programming methods, Nonlinear programming, variance reduced method, Mathematical programming, stochastic Levenberg-Marquardt algorithm, empirical residual optimization problem, mini-batch estimation

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/8015914
https://doi.org/10.1007/s10589-024-00639-8

A gradient projection method for semi-supervised even order hypergraph clustering problems

Autoren: Chang, Jingya Liu, Dongdong Xi, Min

Quelle: Pacific Journal of Optimization. 21:51-62

Schlagwörter: Numerical mathematical programming methods, Classification and discrimination, cluster analysis (statistical aspects), manifold, semi-supervised clustering, Multilinear algebra, tensor calculus, hypergraph, Programming involving graphs or networks, Hypergraphs, tensor

Dateibeschreibung: application/xml

A conic regularized Barzilai–Borwein trust region method for large scale unconstrained optimization: A conic regularized Barzilai-Borwein trust region method for large scale unconstrained optimization

Autoren: Lijuan Zhao

Quelle: Japan Journal of Industrial and Applied Mathematics. 42:553-574

Schlagwörter: Numerical mathematical programming methods, Nonlinear programming, simple conic model, regularized Barzilai-Borwein step, large scale, trust region

Dateibeschreibung: application/xml

Sequential Quadratic Optimization for Stochastic Optimization with Deterministic Nonlinear Inequality and Equality Constraints: Sequential quadratic optimization for stochastic optimization with deterministic nonlinear inequality and equality constraints

Autoren: Frank E. Curtis Daniel P. Robinson Baoyu Zhou

Quelle: SIAM Journal on Optimization. 34:3592-3622

Schlagwörter: 49M05, 49M37, 65K05, 65K10, 90C15, 90C30, 90C55, 0211 other engineering and technologies, Stochastic programming, 02 engineering and technology, Quadratic programming, stochastic optimization, nonlinear optimization, sequential quadratic optimization, Methods of successive quadratic programming type, Numerical mathematical programming methods, Nonlinear programming, Optimization and Control (math.OC), FOS: Mathematics, Mathematics - Optimization and Control

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/abs/2302.14790

Solution of Mismatched Monotone+Lipschitz Inclusion Problems: Solution of mismatched monotone+Lipschitz inclusion problems

Autoren: Chouzenoux, Emilie Pesquet, Jean-Christophe Roldán, Fernando

Weitere Verfasser: Chouzenoux, Emilie Pesquet, Jean-Christophe Roldán, Fernando

Quelle: SIAM Journal on Optimization

Schlagwörter: Convex programming, fixed point theory, [MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC], convex optimisation, convergence analysis, Splitting algorithms, Iterative procedures involving nonlinear operators, Numerical mathematical programming methods, Optimization and Control (math.OC), splitting algorithms, adjoint mismatch, FOS: Mathematics, Variational and other types of inclusions, Monotone operators and generalizations, Mathematics - Optimization and Control, convex optimiza- tion, 47H05, 47H10, 65K05, 90C25

Dateibeschreibung: application/xml; application/pdf

Zugangs-URL: http://arxiv.org/abs/2310.06402
https://zbmath.org/7939058
https://doi.org/10.1137/23m1609166

On convergence of the block Lanczos method for the CDT subproblem

Autoren: Gu, Ying Guo, Yongyan

Quelle: Journal of Applied Mathematics and Computing. 70:6443-6454

Schlagwörter: Numerical optimization and variational techniques, Numerical mathematical programming methods, Block-Lanczos method, CDT subproblem, Quadratic programming, Krylov subspace, convergence analysis

Dateibeschreibung: application/xml

On the Extension of Dai-Liao Conjugate Gradient Method for Vector Optimization: On the extension of Dai-Liao conjugate gradient method for vector optimization

Autoren: Hu, Qingjie Li, Ruyun Zhang, Yanyan et al.

Quelle: Journal of Optimization Theory and Applications. 203:810-843

Schlagwörter: Pareto optimality, global convergence, vector optimization, Numerical mathematical programming methods, Dai-Liao conjugate gradient method, Multi-objective and goal programming

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/7942689
https://doi.org/10.1007/s10957-024-02535-x

Symbolic algorithm for solving SLAEs with multi-diagonal coefficient matrices

Autoren: Veneva Milena

Quelle: Discrete and Continuous Models and Applied Computational Science, Vol 33, Iss 1, Pp 46-56 (2025)

Schlagwörter: numerical analysis, computational methods for sparse matrices, numerical mathematical programming methods, complexity of numerical algorithms, Electronic computers. Computer science, QA75.5-76.95

Dateibeschreibung: electronic resource

Relation: https://journals.rudn.ru/miph/article/viewFile/44732/24876; https://doaj.org/toc/2658-4670; https://doaj.org/toc/2658-7149

Zugangs-URL: https://doaj.org/article/f9e3c5410dc44f88b856ee50ce4a6554

Inexact log-domain interior-point methods for quadratic programming

Autoren: Jordan Leung Frank Permenter Ilya Kolmanovsky

Quelle: Computational Optimization and Applications. 89:625-658

Schlagwörter: Numerical mathematical programming methods, interior-point methods, inexact Newton methods, quadratic programming, Interior-point methods, Quadratic programming, iterative methods for linear systems

Dateibeschreibung: application/xml

An iterative scheme for solving minimization and fixed point problems with medical image restoration

Autoren: Khuanchanok Chaichana Woratham Khangtragool Raweerote Suparatulatorn

Quelle: The Journal of Analysis. 33:537-552

Schlagwörter: Convex programming, Fixed-point theorems, Numerical mathematical programming methods, process innovation, proximal gradient method, image processing

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/8035909
https://doi.org/10.1007/s41478-024-00846-w

Improvement of Convergence of One- and Two-Step MSM Iteration Methods for Nondifferentiable Nonlinear Complementarity Problems: Improvement of convergence of one- and two-step MSM iteration methods for nondifferentiable nonlinear complementarity problems

Autoren: Gui-Lin Yan Yu-Jiang Wu Bo Deng

Quelle: Communications on Applied Mathematics and Computation. 7:733-758

Schlagwörter: nonlinear complementarity problem (NCP), Iterative numerical methods for linear systems, convergence, Numerical mathematical programming methods, modulus-based, multisplitting, \(H_+\)-matrix, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming), \(H\)-splitting

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/8034297
https://doi.org/10.1007/s42967-024-00378-x

A Newton-CG based barrier-augmented Lagrangian method for general nonconvex conic optimization

Autoren: Chuan He Heng Huang Zhaosong Lu

Quelle: Computational Optimization and Applications. 89:843-894

Schlagwörter: FOS: Computer and information sciences, Computer Science - Machine Learning, 0211 other engineering and technologies, operation complexity, Machine Learning (stat.ML), Interior-point methods, 02 engineering and technology, Nonconvex programming, global optimization, 01 natural sciences, Machine Learning (cs.LG), second-order stationary point, Numerical mathematical programming methods, 49M05, 49M15, 68Q25, 90C26, 90C30, 90C60, Nonlinear programming, Statistics - Machine Learning, nonconvex conic optimization, FOS: Mathematics, Mathematics - Numerical Analysis, 0101 mathematics, Mathematics - Optimization and Control, Newton-conjugate gradient method, iteration complexity, Numerical Analysis (math.NA), Methods of quasi-Newton type, Optimization and Control (math.OC), barrier method, augmented Lagrangian method

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/abs/2301.04204
https://zbmath.org/7948914
https://doi.org/10.1007/s10589-024-00603-6

Two self-adaptive derivative-free methods with restart procedure for constrained nonlinear equations with applications

Autoren: Shuangyu Li Liping Pang Menglong Xue et al.

Quelle: Journal of Applied Mathematics and Computing. 70:6219-6243

Schlagwörter: global convergence, signal restoration, Numerical mathematical programming methods, Nonlinear programming, logistic regression, derivative-free method, Derivative-free methods and methods using generalized derivatives, constrained nonlinear equations

Dateibeschreibung: application/xml

A modified Levenberg–Marquardt algorithm for low order-value optimization problem: A modified Levenberg-Marquardt algorithm for low order-value optimization problem

Autoren: Xiaochen Lv Zhensheng Yu

Quelle: Journal of Applied Mathematics and Computing. 70:5629-5644

Schlagwörter: global convergence, Numerical mathematical programming methods, Nonlinear programming, low order-value optimization, 0211 other engineering and technologies, 02 engineering and technology, Levenberg-Marquardt algorithm, outlier detection, 0101 mathematics, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/8036676
https://doi.org/10.1007/s12190-024-02140-1

On solving a revised model of the nonnegative matrix factorization problem by the modified adaptive versions of the Dai–Liao method: On solving a revised model of the nonnegative matrix factorization problem by the modified adaptive versions of the Dai-Liao method

Autoren: Babaie-Kafaki, Saman Dargahi, Fatemeh Aminifard, Zohre

Quelle: Numerical Algorithms. 99:505-519

Schlagwörter: ellipsoid norm, Numerical mathematical programming methods, Numerical linear algebra, conjugate gradient algorithm, quasi-Newton updating formula, 0211 other engineering and technologies, unconstrained optimization, nonnegative matrix factorization, 02 engineering and technology, Methods of quasi-Newton type, 0101 mathematics, 01 natural sciences, Factorization of matrices

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/8032140
https://doi.org/10.1007/s11075-024-01886-w

New Douglas-Rashford Splitting Algorithms for Generalized DC Programming with Applications in Machine Learning: New Douglas-Rashford splitting algorithms for generalized DC programming with applications in machine learning

Autoren: Yonghong Yao Lateef O. Jolaoso Yekini Shehu et al.

Quelle: Journal of Scientific Computing. 103

Schlagwörter: machine learning, Numerical mathematical programming methods, DC programming, Nonlinear programming, Optimization and Control (math.OC), nonconvex optimization, Learning and adaptive systems in artificial intelligence, FOS: Mathematics, Nonconvex programming, global optimization, Douglas-Rachford splitting algorithm, Mathematics - Optimization and Control

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/abs/2404.14800

Sampling and Update Frequencies in Proximal Variance-Reduced Stochastic Gradient Methods: Sampling and update frequencies in proximal variance-reduced stochastic gradient methods

Autoren: Martin Morin Pontus Giselsson

Quelle: Journal of Optimization Theory and Applications. 205

Schlagwörter: Large-scale problems in mathematical programming, FOS: Computer and information sciences, Convex programming, sampling, Computer Science - Machine Learning, 0211 other engineering and technologies, SAGA, L-SVRG, 02 engineering and technology, stochastic gradient, Machine Learning (cs.LG), Numerical mathematical programming methods, epoch length, Nonlinear programming, Optimization and Control (math.OC), variance-reduced, 0202 electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Primary 65K05, Secondary 90C06, 90C25, 90C30, 68Q25, Mathematics - Optimization and Control

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/abs/2002.05545