Suchergebnisse - "((\"programming in abstract spaces\") OR (\"programming in (abstraktes OR abstracts) spaces\"))~"

Efficiency conditions and duality for multiobjective semi-infinite programming problems on Hadamard manifolds

Autoren: Balendu Bhooshan Upadhyay Arnav Ghosh Savin Treanţă

Quelle: Journal of Global Optimization. 89:723-744

Schlagwörter: Programming in abstract spaces, theorems of alternative, multi-objective optimization, duality, semi-infinite programming, Hadamard manifolds, Optimality conditions and duality in mathematical programming, Semi-infinite programming, Multi-objective and goal programming

Dateibeschreibung: application/xml

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

Constraint Qualifications and Optimality Criteria for Nonsmooth Multiobjective Programming Problems on Hadamard Manifolds: Constraint qualifications and optimality criteria for nonsmooth multiobjective programming problems on Hadamard manifolds

Autoren: Balendu Bhooshan Upadhyay Arnav Ghosh Savin Treanţă

Quelle: Journal of Optimization Theory and Applications. 200:794-819

Schlagwörter: Programming in abstract spaces, optimality conditions, constraint qualifications, Nonlinear programming, Hadamard manifolds, Optimality conditions and duality in mathematical programming, Multi-objective and goal programming, mathematical programming

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/7802208
https://doi.org/10.1007/s10957-023-02301-5

Sensitivity Analysis for Convex Multiobjective Programming in Abstract Spaces: Sensitivity analysis for convex multiobjective programming in abstract spaces

Autoren: P. Jiménez Guerra Alejandro Balbás

Quelle: e-Archivo. Repositorio Institucional de la Universidad Carlos III de Madrid
instname
Universidad Carlos III de Madrid (UC3M)

Schlagwörter: Programming in abstract spaces, Convex programming, Applied Mathematics, Sensitivity, stability, parametric optimization, convex multiobjective program, Nonsmooth analysis, 0211 other engineering and technologies, 02 engineering and technology, dual program, Multi-objective and goal programming, Analysis, Empresa

Dateibeschreibung: application/pdf; application/xml

Zugangs-URL: http://hdl.handle.net/10016/6344
https://hdl.handle.net/10016/6344
https://zbmath.org/930214
https://doi.org/10.1006/jmaa.1996.0339
https://www.sciencedirect.com/science/article/pii/S0022247X9690339X
https://www.sciencedirect.com/science/article/abs/pii/S0022247X9690339X

Constraint Qualifications for Nonsmooth Multiobjective Programming Problems with Switching Constraints on Hadamard Manifolds: Constraint qualifications for nonsmooth multiobjective programming problems with switching constraints on Hadamard manifolds

Autoren: Balendu Bhooshan Upadhyay Arnav Ghosh Nader Kanzi et al.

Quelle: Bulletin of the Malaysian Mathematical Sciences Society. 47

Schlagwörter: Programming in abstract spaces, switching constraints, optimality conditions, multi-objective optimization, constraint qualifications, Pareto efficiency, Hadamard manifolds, Optimality conditions and duality in mathematical programming, Semi-infinite programming, Multi-objective and goal programming

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/7850944
https://doi.org/10.1007/s40840-024-01701-8

Cyclic Projections in Hadamard Spaces: Cyclic projections in Hadamard spaces

Autoren: Alexander Lytchak Anton Petrunin

Quelle: Journal of Optimization Theory and Applications. 194:636-642

Schlagwörter: ddc:510, Programming in abstract spaces, Mathematics - Differential Geometry, cyclic projections, asymptotic regularity, Hadamard spaces, 0211 other engineering and technologies, Metric Geometry (math.MG), 02 engineering and technology, 01 natural sciences, Functional Analysis (math.FA), Mathematics - Functional Analysis, Mathematics - Metric Geometry, Differential Geometry (math.DG), FOS: Mathematics, 46N10, 53C23, 0101 mathematics, Mathematics

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/abs/2104.09026
https://zbmath.org/7558555
https://doi.org/10.1007/s10957-022-02043-w

Constraint qualifications and optimality conditions for nonsmooth multiobjective mathematical programming problems with vanishing constraints on Hadamard manifolds via convexificators

Autoren: B.B. Upadhyay Arnav Ghosh Nader Kanzi

Quelle: Journal of Mathematical Analysis and Applications. 542:128873

Schlagwörter: Programming in abstract spaces, constraint qualifications, convexificators, Hadamard manifolds, Optimality conditions and duality in mathematical programming, vanishing constraints, Multi-objective and goal programming

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/7941017
https://doi.org/10.1016/j.jmaa.2024.128873

Enhancing programming learning performance through a Jigsaw collaborative learning method in a metaverse virtual space

Autoren: Chih-Ming Chen Ming-Yan Huang

Quelle: International Journal of STEM Education, Vol 11, Iss 1, Pp 1-24 (2024)

Schlagwörter: Computational thinking, Programming learning, Jigsaw collaborative learning method, Metaverse virtual space, Learning attitude, Education, Education (General), L7-991, Special aspects of education, LC8-6691, Theory and practice of education, LB5-3640

Dateibeschreibung: electronic resource

Relation: https://doaj.org/toc/2196-7822

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

The UPC++ PGAS library for Exascale Computing: Extended Abstract

Autoren: Bonachea, D Bachan, J Hargrove, P et al.

Quelle: 2017-January

Schlagwörter: Exascale computing, Global Address Space, PGAS, UPC++, 4606 Distributed Computing and Systems Software (for-2020), 46 Information and Computing Sciences (for-2020), PGAS, Global Address Space, UPC plus, Exascale computing

Dateibeschreibung: application/pdf

Zugangs-URL: https://escholarship.org/uc/item/5pq438t6
https://escholarship.org/content/qt5pq438t6/qt5pq438t6.pdf

Convex Parametric Programming in Abstract Spaces

Autoren: Sanjo Zlobec Masoud Asgharian

Quelle: Optimization. 51:841-861

Schlagwörter: 0209 industrial biotechnology, 0211 other engineering and technologies, 02 engineering and technology

Zugangs-URL: https://www.tandfonline.com/doi/abs/10.1080/0233193021000015659

A path-following algorithm for stochastic quadratically constrained convex quadratic programming in a Hilbert space.

Autoren: Oulha, Amira Achouak Alzalg, Baha

Quelle: Communications in Combinatorics & Optimization. 2024, Vol. 9 Issue 2, p353-387. 35p.

Schlagwörter: *HILBERT space, *STOCHASTIC analysis, *STOCHASTIC control theory, *INTERIOR-point methods, *CONSTRAINED optimization

Duality theorems for a class of continuous linear programming problems in a space of bochneb-integrable abstract functions: Duality theorems for a class of continuous linear programming problems in a space of Bochner-integrable abstract functions

Autoren: Frebi Tröltzsch

Quelle: Mathematische Operationsforschung und Statistik. Series Optimization. 11:375-388

Schlagwörter: Programming in abstract spaces, primal optimal solution, Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming, dual optimal solution. survey, General theory of locally convex spaces, solution existence proofs, Linear programming, duality, locally convex linear spaces, 0101 mathematics, p-times Bochner-integrable abstract functions, 01 natural sciences, continuous linear programming

Dateibeschreibung: application/xml

Zugangs-URL: http://www.tandfonline.com/doi/abs/10.1080/02331938008842666

Kernel-Based Impulse Response Identification With Side-Information on Steady-State Gain: Kernel-based impulse response identification with side-information on steady-state gain

Autoren: M. Khosravi R. S. Smith

Quelle: IEEE Transactions on Automatic Control. 68:6401-6408

Schlagwörter: Optimization, Programming in abstract spaces, Convex programming, 0209 industrial biotechnology, steady-state gain (SSG), kernel-based identification method, Systems and Control (eess.SY), 02 engineering and technology, Electrical Engineering and Systems Science - Systems and Control, Finite impulse response filters, 0203 mechanical engineering, FOS: Electrical engineering, electronic engineering, information engineering, FOS: Mathematics, Side-information, System identification, Mathematics - Optimization and Control, Kernel-based identification method, Mathematical models, Numerical stability, Steady-state, Kernel, Applications of mathematical programming, Optimization and Control (math.OC), Estimation, side-information, Steady-state gain

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/abs/2111.00409
https://zbmath.org/7794488
https://doi.org/10.1109/tac.2023.3243099
http://resolver.tudelft.nl/uuid:b9ec826f-4914-4a2f-bcc4-be69a5967b1a

Connectedness of Cone-Efficient Solution Set for Cone-Quasiconvex Multiobjective Programming in Locally Convex Spaces: Connectedness of cone-efficient solution set for cone-quasiconvex multiobjective programming in locally convex spaces

Autoren: Yu-da Hu Xuan-wei Zhou

Quelle: Acta Mathematicae Applicatae Sinica, English Series. 20:309-316

Schlagwörter: Programming in abstract spaces, Multiobjective programming, cone-efficient solution, 0211 other engineering and technologies, generalized saddle theorem, 02 engineering and technology, Multi-objective and goal programming, cone-quasiconvex mapping, connectedness

Dateibeschreibung: application/xml

Zugangs-URL: https://link.springer.com/article/10.1007/s10255-004-0169-8
https://link.springer.com/content/pdf/10.1007%2Fs10255-004-0169-8.pdf

Post-optimality sensitivity analysis in abstract spaces with applications to continuous-time programming problems

Autoren: J. Abrham R. N. Buie

Quelle: Journal of Optimization Theory and Applications. 45:347-373

Schlagwörter: Programming in abstract spaces, stability theory, Convex programming, perturbation, concave objective functional, rate of change, 0211 other engineering and technologies, 02 engineering and technology, convex operator inequality contraints, Fréchet and Gateaux differentiability in optimization, generalized inverse operators, 01 natural sciences, Methods of successive quadratic programming type, continuous-time linear programming, sensitivity analysis, Fréchet differentiability, Sensitivity, stability, parametric optimization, continuity results, 0101 mathematics, approximation

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/3862958
https://doi.org/10.1007/bf00938440
https://link.springer.com/article/10.1007/BF00938440
https://link.springer.com/content/pdf/10.1007/BF00938440.pdf

An attack on a key exchange protocol based on max-times and min-times algebras

Autoren: Ivan Buchinskiy Matvei Kotov Alexander Treier

Quelle: Indian Journal of Pure and Applied Mathematics. 56:180-190

Schlagwörter: Programming in abstract spaces, key exchange protocol, matrix powers, Analysis of algorithms and problem complexity, max-times algebra, Cryptography, Algebraic coding theory, cryptography (number-theoretic aspects), Programming involving graphs or networks, Max-plus and related algebras, min-times algebra, Applications of tropical geometry, tropical algebra

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/7985490
https://doi.org/10.1007/s13226-023-00469-0

On equilibrium problem of abstract economy, generalized quasi-variational inequality, and an optimization problem in locally H-convex spaces: On equilibrium problem of abstract economy, generalized quasi-variational inequality, and an optimization problem in locally \(H\)-convex spaces

Autoren: Wu, Xian Yuan, Xian-Zhi

Quelle: Journal of Mathematical Analysis and Applications. 282:495-504

Schlagwörter: Programming in abstract spaces, H-convex set, Applied Mathematics, 2603 Analysis, \(H\)-space, Upper semicontinuous multivated mapping, Upper semicontinuous multivalued mapping, 01 natural sciences, equilibrium existence for economies, upper semicontinuous multivalued mapping, 2604 Applied Mathematics, Games with infinitely many players, \(H\)-convex set, Locally H-convex space, General equilibrium theory, 0101 mathematics, Locally \(H\)-convex space, H-space, Analysis

Dateibeschreibung: application/xml

Zugangs-URL: https://www.sciencedirect.com/science/article/pii/S0022247X03001057
https://espace.library.uq.edu.au/view/UQ:704157
https://www.sciencedirect.com/science/article/abs/pii/S0022247X03001057

Rates of asymptotic regularity for the alternating Halpern–Mann iteration: Rates of asymptotic regularity for the alternating Halpern-Mann iteration

Autoren: Laurenţiu Leuştean Pedro Pinto

Quelle: Optimization Letters. 18:529-543

Schlagwörter: Programming in abstract spaces, Mann iteration, Halpern iteration, proof mining, Optimization and Control (math.OC), FOS: Mathematics, rates of asymptotic regularity, 0101 mathematics, uniform convexity, Mathematics - Optimization and Control, 01 natural sciences, 47J25, 47H09, 03F10

Dateibeschreibung: application/xml

Zugangs-URL: http://arxiv.org/abs/2206.02226
https://zbmath.org/7814898
https://doi.org/10.1007/s11590-023-02002-y

A survey of methods of abstract convex programming

Autoren: Mikhail Andramonov

Quelle: Journal of Statistics and Management Systems. 5:21-37

Schlagwörter: Programming in abstract spaces, Convex programming, Polyhedral combinatorics, branch-and-bound, branch-and-cut, 0211 other engineering and technologies, 02 engineering and technology

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/2230166
https://doi.org/10.1080/09720510.2002.10701049
http://www.tandfonline.com/doi/pdf/10.1080/09720510.2002.10701049

Duality theorems and algorithms for linear programming in measure spaces

Autoren: C. F. Wen Soon-Yi Wu

Quelle: Journal of Global Optimization. 30:207-233

Schlagwörter: Programming in abstract spaces, Linear programming, 0211 other engineering and technologies, duality theory, linear programming, 02 engineering and technology, Optimality conditions and duality in mathematical programming, 0101 mathematics, 01 natural sciences

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/2168243
https://doi.org/10.1007/s10898-004-8274-z
https://ideas.repec.org/a/spr/jglopt/v30y2004i2p207-233.html
https://link.springer.com/article/10.1007/s10898-004-8274-z
https://dblp.uni-trier.de/db/journals/jgo/jgo30.html#WenW04
https://EconPapers.repec.org/RePEc:spr:jglopt:v:30:y:2004:i:2:p:207-233