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

Formal Methods for Robot Motion Planning with Time and Space Constraints (Extended Abstract)

Autoren: Barbosa, Fernando S. Karlsson, Jesper Tajvar, Pouria et al.

Quelle: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). :1-14

Schlagwörter: Feedback control, Motion planning, MTL, RRT, STL, Temporal logic, Computer circuits, Cost functions, Feedback, Fixed wings, Formal methods, Robots, Time sharing systems, Topology, Unmanned aerial vehicles (UAV), Asymptotically optimal, Autonomous exploration, Computational tractability, Hybrid feedback control, Interval temporal logic, Linear temporal logic, Motion planning algorithms, Robot motion planning, Robot programming

Dateibeschreibung: print

Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-311761

Programming Aspiration: Mack Scogin Merrill Elam Knowlton Hall

Autoren: Elam, Mack Scogin Merrill

Quelle: PRAXIS: Journal of Writing + Building, 2006 Jan 01(8), 36-47.

Zugangs-URL: https://www.jstor.org/stable/24328973

Equilibrium programming in Hilbert spaces

Autoren: Combettes, Patrick Louis Hirstoaga, Sever Adrian Ruprecht, Liliane

Weitere Verfasser: Combettes, Patrick Louis Hirstoaga, Sever Adrian Ruprecht, Liliane

Schlagwörter: Programming in abstract spaces, [MATH.MATH-NA] Mathematics [math]/Numerical Analysis [math.NA], Optimality conditions for problems in abstract spaces, Minimax problems in mathematical programming

Dateibeschreibung: application/xml

Zugangs-URL: https://hal.science/hal-00017823v1
https://zbmath.org/2182576

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

abstract convexity in measure theory and in convex analysis: Abstract convexity in measure theory and in convex analysis.

Autoren: V. L. Levin

Quelle: Journal of Mathematical Sciences. 116(4):3432-3467

Schlagwörter: Programming in abstract spaces, Convex programming, abstract convexity, Functional analytic lifting theory, Lifting theory, Nonsmooth analysis, Variational problems in a geometric measure-theoretic setting, mass transportation, lifting

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/2094859
https://doi.org/10.1023/a:1024033523973
https://rd.springer.com/article/10.1023/a:1024033523973
http://mathecon.cemi.rssi.ru/vlevin/files/JMS2003.pdf
https://link.springer.com/article/10.1023%2FA%3A1024033523973

Markovian Decision Processes with Compact Action Spaces

Autoren: Furukawa, Nagata

Quelle: The Annals of Mathematical Statistics, 1972 Oct 01. 43(5), 1612-1622.

Zugangs-URL: https://www.jstor.org/stable/2240083

on an augmented lagrangian sqp method for a class of optimal control problems in banach spaces: On an augmented Lagrangian SQP method for a class of optimal control problems in Banach spaces

Autoren: Nadir Arada Fredi Tröltzsch Jean-Pierre Raymond

Quelle: Computational Optimization and Applications. 22(3):369-398

Schlagwörter: Methods of successive quadratic programming type, Programming in abstract spaces, augmented Lagrangian SQP method in Banach spaces, optimal control, two-norm discrepancy, Numerical methods based on nonlinear programming, generalized Newton method, generalized equation, semilinear parabolic equation, Methods of quasi-Newton type, control constraints

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1930242
https://doi.org/10.1023/a:1019763022415
https://link.springer.com/article/10.1023%2FA%3A1019763022415
https://doi.org/10.1023/A:1019763022415

Maximal Average-Reward Policies for Semi-Markov Decision Processes With Arbitrary State and Action Space

Autoren: Lippman, Steven A.

Quelle: The Annals of Mathematical Statistics, 1971 Oct 01. 42(5), 1717-1726.

Zugangs-URL: https://www.jstor.org/stable/2240295

extension of subgradient techniques for nonsmooth optimization in banach spaces: Extension of subgradient techniques for nonsmooth optimization in Banach spaces

Autoren: Ya. I. Alber Alfredo N. Iusem

Quelle: Set-valued Analysis. 9(4):315-335

Schlagwörter: Programming in abstract spaces, Convex programming, subgradient method, nonsmooth convex functional, subgradient, duality mapping, generalized projection, \(J\)-Lipschitz continuous functional, weak convergence, estimates of convergence rate, Applications of functional analysis in optimization, convex analysis, mathematical programming, economics

Dateibeschreibung: application/xml

Zugangs-URL: https://link.springer.com/article/10.1023%2FA%3A1012665832688

notions of relative interior in banach spaces: Notions of relative interior in Banach spaces

Autoren: Borwein, J. Goebel, R.

Quelle: Journal of Mathematical Sciences. 115(4):2542-2553

Schlagwörter: Programming in abstract spaces, Banach spaces, topology, Geometry and structure of normed linear spaces, calculus, complex variables, convex domains, Set-valued and variational analysis

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1981999
https://doi.org/10.1023/a:1022988116044
https://link.springer.com/article/10.1023/A:1022988116044

φ convex functions defined on metric spaces: \(\Phi\)-convex functions defined on metric spaces

Autoren: S. Rolewicz

Quelle: Journal of Mathematical Sciences. 115(5):2631-2652

Schlagwörter: Programming in abstract spaces, Banach spaces, Convex functions and convex programs in convex geometry, Fréchet differentiability, Nonsmooth analysis, subdifferential, Fréchet and Gateaux differentiability in optimization, Set-valued and variational analysis, Convexity of real functions of several variables, generalizations, Asplund theorem

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1982008
https://doi.org/10.1023/a:1023296417861
https://rd.springer.com/article/10.1023/a:1023296417861
https://link.springer.com/article/10.1023%2FA%3A1023296417861

convergence properties of feasible descent methods for solving variational inequalities in banach spaces: Convergence properties of feasible descent methods for solving variational inequalities in Banach spaces

Autoren: Dao Li Zhu Patrice Marcotte

Quelle: Computational Optimization and Applications. 10(1):35-49

Schlagwörter: Programming in abstract spaces, global convergence, Banach spaces, Frank-Wolfe algorithm, projection, Variational inequalities, Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming), variational inequalities, feasible descent methods

Dateibeschreibung: application/xml

Zugangs-URL: https://zbmath.org/1139629
https://doi.org/10.1023/a:1018387816972
https://dblp.uni-trier.de/db/journals/coap/coap10.html#ZhuM98
https://trid.trb.org/view/523061
http://www.iro.umontreal.ca/~marcotte/ARTIPS/1998_COA.pdf
https://link.springer.com/article/10.1023/A%3A1018387816972

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

When do bounds and domain propagation lead to the same search space?

Autoren: Schulte, Christian Stuckey, P. J.

Quelle: ACM Transactions on Programming Languages and Systems. 27(3):388-425

Schlagwörter: constraint (logic) programming, finite domain constraints, bounds propagation, domain propagation, abstract interpretation, program analysis, logic programs, constraint

Dateibeschreibung: print

Zugangs-URL: https://urn.kb.se/resolve?urn=urn:nbn:se:kth:diva-14844

Dynamic programming and brachistochrone problems in abstract spaces. Technical report No. RB73-28

Weitere Verfasser: Bellman, R

Quelle: Other Information: Orig. Receipt Date: 31-DEC-74

Dateibeschreibung: Medium: X; Size: Pages: 17

Zugangs-URL: http://www.osti.gov/scitech/biblio/4278165

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