Damage Location in Mechanical Structures by Multi-Objective Pattern Search

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Günther, Christian, Hofmeister, Benedikt, Hübler, Clemens, Jonscher, Clemens, Ragnitz, Jasper, Schubert, Jenny, Steinbach, Marc C.
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Optimization and Control 70J10, 74R99, 90C26, 90C29, 90C59
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A study of column generation embedded in scalarization methods for the bi-objective cutting stock problem
di: Borges, Jennifer C., et al.
Pubblicazione: (2026)

A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
di: Dörfler, Daniel, et al.
Pubblicazione: (2020)

A Solution Concept for Convex Vector Optimization Problems based on a User-defined Region of Interest
di: Dörfler, Daniel, et al.
Pubblicazione: (2026)

Reinforcement Learning for Search Tree Size Minimization in Constraint Programming: New Results on Scheduling Benchmarks
di: Heinz, Vilém, et al.
Pubblicazione: (2025)

Existence of solutions for polyhedral convex set optimization problems
di: Löhne, Andreas
Pubblicazione: (2023)

A solution method for arbitrary polyhedral convex set optimization problems
di: Löhne, Andreas
Pubblicazione: (2023)

A Note on Piecewise Affine Decision Rules for Robust, Stochastic, and Data-Driven Optimization
di: Thomä, Simon, et al.
Pubblicazione: (2024)

MOCVXPY: a CVXPY extension for multiobjective optimization
di: Salomon, Ludovic, et al.
Pubblicazione: (2025)

Convergence analysis of a primal-dual optimization-by-continuation algorithm
di: Loris, Ignace, et al.
Pubblicazione: (2023)

On approximate Pareto solutions in nonsmooth interval-valued multiobjective optimization with data uncertainty in constraints
di: Quan, Vu Hong, et al.
Pubblicazione: (2025)

Bi-Objective Optimization over the Efficient Set of Multi-Objective Integer Quadratic Problem
di: Bencheikh, Ali, et al.
Pubblicazione: (2024)

A diving heuristic for mixed-integer problems with unbounded semi-continuous variables
di: Halbig, Katrin, et al.
Pubblicazione: (2024)

A Multi-Reference Relaxation Enforced Neighborhood Search Heuristic in SCIP
di: Bolusani, Suresh, et al.
Pubblicazione: (2024)

Cardinality-Constrained Multi-Objective Optimization: Novel Optimality Conditions and Algorithms
di: Lapucci, Matteo, et al.
Pubblicazione: (2023)

Characterization of Highly Robust Solutions in Multi-Objective Programming in Banach Spaces
di: Rahimi, Morteza, et al.
Pubblicazione: (2025)

Projection, Degeneracy, and Singularity Degree for Spectrahedra
di: Im, Haesol, et al.
Pubblicazione: (2024)

Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
di: Qu, Zheng, et al.
Pubblicazione: (2023)

A Canceling Heuristic for the Directed Traveling Salesman Problem
di: Borgwardt, Steffen, et al.
Pubblicazione: (2026)

Fix-and-Propagate Heuristics Using Low-Precision First-Order LP Solutions for Large-Scale Mixed-Integer Linear Optimization
di: Kempke, Nils-Christian, et al.
Pubblicazione: (2025)

Perpertual Coupled Simulated Annealing for Continuous Optimization
di: Gonçalves-e-Silva, Kayo, et al.
Pubblicazione: (2018)

Multi-convex Programming for Discrete Latent Factor Models Prototyping
di: Zhu, Hao, et al.
Pubblicazione: (2025)

Optimal routing and transmission strategies for UAV reconnaissance missions with detection threats
di: Badenbroek, Riley, et al.
Pubblicazione: (2024)

Low-Rank Multi-Objective Linear Programming
di: Löhne, Andreas, et al.
Pubblicazione: (2025)

Flow-based Extremal Mathematical Structure Discovery
di: Bérczi, Gergely, et al.
Pubblicazione: (2026)

Fitting Reinforcement Learning Model to Behavioral Data under Bandits
di: Zhu, Hao, et al.
Pubblicazione: (2025)

A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization
di: Mansueto, Pierluigi
Pubblicazione: (2025)

An ODE approach to multiple choice polynomial programming
di: Shao, Sihong, et al.
Pubblicazione: (2022)

Metaheuristic algorithms for the induced P-median problem with upgrades
di: Salazar, Sergio, et al.
Pubblicazione: (2026)

Lagrange Multipliers, Duality, and Sensitivity in Set-Valued Convex Programming via Pointed Closed Convex Processes
di: García-Castaño, Fernando, et al.
Pubblicazione: (2024)

A Set-Valued Lagrange Theorem based on a Process for Convex Vector Programming
di: García-Castaño, Fernando, et al.
Pubblicazione: (2024)

Heuristic algorithms for the stochastic critical node detection problem
di: Bayarsaikhan, Tuguldur, et al.
Pubblicazione: (2025)

Augmentation Algorithms for Integer Programs with Total Variation-like Regularization
di: Yang, Dominic, et al.
Pubblicazione: (2025)

Fitted value iteration methods for bicausal optimal transport
di: Bayraktar, Erhan, et al.
Pubblicazione: (2023)

On Computing and Pricing of Adjustable Robust Chemical Process Designs
di: Schwientek, Jan, et al.
Pubblicazione: (2025)

Simulation-Optimization Approaches for the Network Immunization Problem with Quarantining
di: Hoogervorst, Rowan, et al.
Pubblicazione: (2024)

Optimality Conditions and Numerical Algorithms for a Class of Minimax Bilevel Optimization Problems
di: Hu, Yaling, et al.
Pubblicazione: (2026)

Symmetric and Non-Symmetric Cone Separation via Bishop-Phelps Cones in Normed Spaces
di: García-Castaño, Fernando, et al.
Pubblicazione: (2025)

Asymmetric Long-Step Primal-Dual Interior-Point Methods with Dual Centering
di: Nesterov, Yurii
Pubblicazione: (2025)

Effective Front-Descent Algorithms with Convergence Guarantees
di: Lapucci, Matteo, et al.
Pubblicazione: (2024)

Generalized Reduced Jacobian Method
di: Maghri, M. El, et al.
Pubblicazione: (2025)