Interval global optimization problem in max-plus algebra

Συγγραφείς: Helena Myšková, Ján Plavka

Πηγή: Linear Algebra and its Applications. 714:45-63

Θεματικοί όροι: interval global optimization, Discrete-time control/observation systems, max-plus linear system, global optimization, interval matrix, max-plus algebra, distributed system, Max-plus and related algebras, Nonconvex programming, global optimization

Περιγραφή αρχείου: application/xml

Sparse Polynomial Optimization with Unbounded Sets: Sparse polynomial optimization with unbounded sets

Συγγραφείς: Lei Huang, Shucheng Kang, Jie Wang, Heng Yang

Πηγή: SIAM Journal on Optimization. 35:593-621

Θεματικοί όροι: unbounded set, 90C23, 90C17, 90C22, 90C26, Polynomial optimization, semidefinite relaxation, Optimization and Control (math.OC), polynomial optimization, sparsity, FOS: Mathematics, moment-SOS hierarchy, Semidefinite programming, Robustness in mathematical programming, Nonconvex programming, global optimization, Mathematics - Optimization and Control

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2401.15837

Convex envelopes of bounded monomials on two-variable cones

Συγγραφείς: Pietro Belotti

Πηγή: Mathematical Programming. 211:93-123

Θεματικοί όροι: monomials, volume, Polynomial optimization, 90C30, 90C26, 90C23, Nonlinear programming, Optimization and Control (math.OC), branching, FOS: Mathematics, convex envelope, Nonconvex programming, global optimization, Mathematics - Optimization and Control

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2308.12650
https://zbmath.org/8035681
https://doi.org/10.1007/s10107-025-02212-5

Accelerated gradient methods on the Grassmann and Stiefel manifolds

Συγγραφείς: Xiaojing Zhu

Πηγή: Japan Journal of Industrial and Applied Mathematics. 42:751-786

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/8037191
https://doi.org/10.1007/s13160-025-00692-8

Compositional Maps for Registration in Complex Geometries: Compositional maps for registration in complex geometries

Συγγραφείς: Taddei T

Πηγή: SIAM Journal on Scientific Computing. 47:B220-B251

Θεματικοί όροι: model order reduction, registration in bounded domains, Approximation by arbitrary nonlinear expressions, widths and entropy, FOS: Mathematics, parameterized partial differential equations, Mathematics - Numerical Analysis, Numerical Analysis (math.NA), Finite element, Rayleigh-Ritz and Galerkin methods for boundary value problems involving PDEs, 41A46, 65N30, 90C26, 35L02, Nonconvex programming, global optimization, First-order hyperbolic equations

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2308.15307

A Relaxed Vector Auxiliary Variable Algorithm for Unconstrained Optimization Problems: A relaxed vector auxiliary variable algorithm for unconstrained optimization problems

Συγγραφείς: Shiheng Zhang, Jiahao Zhang, Jie Shen, Guang Lin

Πηγή: SIAM Journal on Scientific Computing. 47:C126-C150

Θεματικοί όροι: Artificial intelligence, adaptive learning rate, machine learning, Analysis of algorithms, SAV, Nonconvex programming, global optimization, optimization, gradient descent

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/7988242
https://doi.org/10.1137/23m1611087

An inverse problem of determining the parameters in diffusion equations by using fractional physics-informed neural networks

Συγγραφείς: M. Srati, A. Oulmelk, L. Afraites, A. Hadri, M.A. Zaky, A. Aldraiweesh, A.S. Hendy

Πηγή: Applied Numerical Mathematics. 208:189-213

Θεματικοί όροι: time-fractional diffusion equations, Numerical optimization and variational techniques, Inverse problems for PDEs, Numerical methods for inverse problems for initial value and initial-boundary value problems involving PDEs, Nonconvex programming, global optimization, Fractional partial differential equations, alternating direction multiplier method, inverse parameter problem, Fractional derivatives and integrals, physics-informed neural network method, Initial-boundary value problems for higher-order parabolic equations, DeepONets method, Numerical methods for partial differential equations, initial value and time-dependent initial-boundary value problems, gradient descent method, Artificial neural networks and deep learning

Περιγραφή αρχείου: application/xml

Inexact proximal point method with a Bregman regularization for quasiconvex multiobjective optimization problems via limiting subdifferentials

Συγγραφείς: Balendu Bhooshan Upadhyay, Subham Poddar, Jen-Chih Yao, Xiaopeng Zhao

Πηγή: Annals of Operations Research. 345:417-466

Θεματικοί όροι: generalized convexity, Numerical optimization and variational techniques, Numerical methods based on nonlinear programming, Mordukhovich subdifferential, multiobjective optimization, Nonconvex programming, global optimization, sparse optimization, proximal point method, Bregman distance

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/7985174
https://doi.org/10.1007/s10479-024-06461-z

Heavy-ball-based relaxed optimal s-thresholding algorithms for solving compressed sensing problem

Συγγραφείς: Qiu, Ming, Qu, Biao, Yang, Yang

Πηγή: Mathematical Foundations of Computing. 8:419-432

Θεματικοί όροι: optimal s-thresholding algorithm, convergence, Numerical methods based on nonlinear programming, Nonlinear programming, heavy-ball method, Nonconvex programming, global optimization, compressed sensing

Περιγραφή αρχείου: application/xml

Sparsity penalized mean–variance portfolio selection: analysis and computation: Sparsity penalized mean-variance portfolio selection: analysis and computation

Συγγραφείς: Buse Şen, Deniz Akkaya, Mustafa Ç. Pınar

Πηγή: Mathematical Programming. 211:281-318

Θεματικοί όροι: regularization, Portfolio theory, Numerical methods (including Monte Carlo methods), sparsity, branch-and-bound, Nonconvex programming, global optimization, mean-variance portfolio, L0-norm

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/8035687
https://doi.org/10.1007/s10107-024-02161-5

MultiSQP-GS: a sequential quadratic programming algorithm via gradient sampling for nonsmooth constrained multiobjective optimization

Συγγραφείς: Mehri Rashidi, Majid Soleimani-damaneh

Πηγή: Computational Optimization and Applications. 89:729-767

Θεματικοί όροι: sequential quadratic programming (SQP), nonconvex optimization, Quadratic programming, gradient sampling (GS), exact penalization, Nonconvex programming, global optimization, multi-objective programming, Multi-objective and goal programming, nonsmooth optimization, constrained optimization

Περιγραφή αρχείου: application/xml

A reformulation-enumeration MINLP algorithm for gas network design

Συγγραφείς: Yijiang Li, Santanu S. Dey, Nikolaos V. Sahinidis

Πηγή: Journal of Global Optimization. 90:931-963

Θεματικοί όροι: Mixed integer programming, Nonlinear programming, Optimization and Control (math.OC), global optimization, Deterministic network models in operations research, network design, FOS: Mathematics, Integer programming, mixed integer nonlinear program, Nonconvex programming, global optimization, Mathematics - Optimization and Control

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2307.07648
https://zbmath.org/7941541
https://doi.org/10.1007/s10898-024-01424-x

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

Συγγραφείς: Chuan He, Heng Huang, Zhaosong Lu

Πηγή: Computational Optimization and Applications. 89:843-894

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2301.04204
https://zbmath.org/7948914
https://doi.org/10.1007/s10589-024-00603-6

An inexact regularized proximal Newton method without line search

Συγγραφείς: Simeon vom Dahl, Christian Kanzow

Πηγή: Computational Optimization and Applications. 89:585-624

Θεματικοί όροι: ddc:510, Numerical optimization and variational techniques, 0209 industrial biotechnology, nonsmooth and nonconvex optimization, Regularized proximal Newton method, Hölderian local error bound, 0211 other engineering and technologies, global and local convergence, 02 engineering and technology, Global and local convergence, Methods of quasi-Newton type, Nonconvex programming, global optimization, 49M15, 65K10, 90C26, 90C30, 90C55, Nonlinear programming, Optimization and Control (math.OC), FOS: Mathematics, Nonsmooth and nonconvex optimization, Mathematics - Optimization and Control, regularized proximal Newton method

Περιγραφή αρχείου: application/xml; application/pdf

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2404.02635
https://hdl.handle.net/10419/315247
https://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/39883
https://doi.org/10.1007/s10589-024-00600-9
https://nbn-resolving.org/urn:nbn:de:bvb:20-opus-398839
https://opus.bibliothek.uni-wuerzburg.de/files/39883/10589_2024_Article_600.pdf

A radial basis function method for noisy global optimisation

Συγγραφείς: Dirk Banholzer, Jörg Fliege, Ralf Werner

Πηγή: Math Program

Θεματικοί όροι: ddc:510, expensive noisy objective function, controlled noise, Full Length Paper, 0211 other engineering and technologies, radial basis functions, 02 engineering and technology, Nonconvex programming, global optimization, 01 natural sciences, response surface methods, Nonlinear programming, global optimisation, 0101 mathematics, approximation

Περιγραφή αρχείου: application/xml; text

Σύνδεσμος πρόσβασης: https://pubmed.ncbi.nlm.nih.gov/40309715
https://zbmath.org/8035680
https://doi.org/10.1007/s10107-024-02125-9
https://opus.bibliothek.uni-augsburg.de/opus4/frontdoor/index/index/docId/115083
https://doi.org/10.1007/s10107-024-02125-9

Output-space branch-and-bound reduction algorithm for solving generalized linear multiplicative programming programs

Συγγραφείς: Ma, Suxia, Gao, Yuelin, Zhang, Bo

Πηγή: Journal of Applied Mathematics and Computing. 70:5917-5947

Θεματικοί όροι: computational complexity, output-space region reduction, Nonlinear programming, global optimization, generalized linear multiplicative program, Polyhedral combinatorics, branch-and-bound, branch-and-cut, branch-and-bound, Nonconvex programming, global optimization

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/8036688
https://doi.org/10.1007/s12190-024-02202-4

A Two-Step Proximal Point Algorithm for Nonconvex Equilibrium Problems with Applications to Fractional Programming: A two-step proximal point algorithm for nonconvex equilibrium problems with applications to fractional programming

Συγγραφείς: Alfredo Iusem, Felipe Lara, Raúl T. Marcavillaca, Le Hai Yen

Πηγή: Journal of Global Optimization. 90:755-779

Θεματικοί όροι: generalized convexity, fractional programming, nonconvex optimization, equilibrium problems, Fractional programming, Nonconvex programming, global optimization, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming), proximal point methods

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/7937689
https://doi.org/10.1007/s10898-024-01419-8

Multi-choice conic goal programming model-based network data envelopment analysis

Συγγραφείς: Derya Deli̇ktaş, Ozden Ustun, Ezgi Aktar Demirtas, Rifat Aykut Arapoglu

Πηγή: RAIRO - Operations Research. 58:3391-3416

Θεματικοί όροι: network DEA, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, data envelopment analysis, 02 engineering and technology, Geometric programming, multi-choice conic goal programming, Nonconvex programming, global optimization, multi-objective programming

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/7963171
https://doi.org/10.1051/ro/2024117

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

Συγγραφείς: Yonghong Yao, Lateef O. Jolaoso, Yekini Shehu, Jen-Chih Yao

Πηγή: Journal of Scientific Computing. 103

Θεματικοί όροι: 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

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: http://arxiv.org/abs/2404.14800

Mas-Colell Properness Condition and Almost Convexity in Nonconvex Optimization: Mas-Colell properness condition and almost convexity in nonconvex optimization

Συγγραφείς: Fabián Flores-Bazán

Πηγή: Journal of Optimization Theory and Applications. 205

Θεματικοί όροι: Fenchel subdifferential, Nonlinear programming, quasi (relative) interior, strong duality, Nonconvex programming, global optimization, Duality theory (optimization), Mas-Colell properness condition, almost convexity

Περιγραφή αρχείου: application/xml

Σύνδεσμος πρόσβασης: https://zbmath.org/8034609
https://doi.org/10.1007/s10957-025-02677-6