Copertina

Global Optimization of Gaussian processes

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Schweidtmann, Artur M., Bongartz, Dominik, Grothe, Daniel, Kerkenhoff, Tim, Lin, Xiaopeng, Najman, Jaromil, Mitsos, Alexander
Natura:	Preprint
Pubblicazione:	2020
Soggetti:	Optimization and Control Machine Learning 90C26, 90C30, 90C90, 68T01, 60-04
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Optimization with Trained Machine Learning Models Embedded
di: Schweidtmann, Artur M., et al.
Pubblicazione: (2022)

Accelerating Deterministic Global Optimization via GPU-parallel Interval Arithmetic
di: Zhang, Hongzhen, et al.
Pubblicazione: (2025)

A Globally Convergent Gradient Method with Momentum
di: Lapucci, Matteo, et al.
Pubblicazione: (2024)

Norm-induced Cuts: Outer Approximation for Lipschitzian Constraint Functions
di: Göß, Adrian, et al.
Pubblicazione: (2024)

Riemannian Gradient Method with Momentum
di: Leggio, Filippo, et al.
Pubblicazione: (2026)

Barrier Algorithms for Constrained Non-Convex Optimization
di: Dvurechensky, Pavel, et al.
Pubblicazione: (2024)

Riemannian Adaptive Regularized Newton Methods with Hölder Continuous Hessians
di: Zhang, Chenyu, et al.
Pubblicazione: (2023)

cuHALLaR: A GPU Accelerated Low-Rank Augmented Lagrangian Method for Large-Scale Semidefinite Programming
di: Aguirre, Jacob M., et al.
Pubblicazione: (2025)

Clash of MINLP Relaxations: Piecewise Linear vs. Global Parabolic
di: Göß, Adrian
Pubblicazione: (2026)

Optimization over convex polyhedra via Hadamard parametrizations
di: Tang, Tianyun, et al.
Pubblicazione: (2024)

A Surrogate Value Function Formulation for Bilevel Optimization
di: Xu, Mengwei, et al.
Pubblicazione: (2025)

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
di: Quintero, Rodolfo A., et al.
Pubblicazione: (2024)

Derivative-Free Bilevel Optimization with Inexact Lower-Level Solutions
di: Cesaroni, Edoardo, et al.
Pubblicazione: (2026)

Parabolic Approximation & Relaxation for MINLP
di: Göß, Adrian, et al.
Pubblicazione: (2024)

Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
di: Lapucci, Matteo, et al.
Pubblicazione: (2024)

Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization
di: Higuchi, Rei, et al.
Pubblicazione: (2024)

On Tackling High-Dimensional Nonconvex Stochastic Optimization via Stochastic First-Order Methods with Non-smooth Proximal Terms and Variance Reduction
di: Xie, Yue, et al.
Pubblicazione: (2025)

Optimal Subgradient Methods for Lipschitz Convex Optimization with Error Bounds
di: Wang, Alex L.
Pubblicazione: (2025)

Solving Sparse MIQCQPs: Application to the Unit Commitment Problem with ACOPF Constraints
di: Gómez-Casares, Ignacio, et al.
Pubblicazione: (2025)

Depth-first directional search for nonconvex optimization
di: Zhang, Yuxuan, et al.
Pubblicazione: (2024)

Projected Gradient Methods with Momentum
di: Lapucci, Matteo, et al.
Pubblicazione: (2026)

A Stochastic Quasi-Newton Method in the Absence of Common Random Numbers
di: Menickelly, Matt, et al.
Pubblicazione: (2023)

Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs
di: McRae, Andrew D., et al.
Pubblicazione: (2023)

Hidden convexity of quadratic systems and its application to quadratic programming
di: Huy, Nguyen Quang, et al.
Pubblicazione: (2026)

A minimal face constant rank constraint qualification for reducible conic programming
di: Andreani, Roberto, et al.
Pubblicazione: (2023)

A low-rank augmented Lagrangian method for large-scale semidefinite programming based on a hybrid convex-nonconvex approach
di: Monteiro, Renato D. C., et al.
Pubblicazione: (2024)

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

Projection-based curve pattern search for black-box optimization over smooth convex sets
di: Jia, Xiaoxi, et al.
Pubblicazione: (2025)

Penalty decomposition derivative free method for the minimization of partially separable functions over a convex feasible set
di: Cecere, Francesco, et al.
Pubblicazione: (2025)

Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
di: González-Díaz, Julio, et al.
Pubblicazione: (2025)

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
di: Ghaffari-Hadigheh, Alireza, et al.
Pubblicazione: (2022)

Delayed Feedback in Online Non-Convex Optimization: A Non-Stationary Approach with Applications
di: Lara, Felipe, et al.
Pubblicazione: (2024)

A Modified Proximal Bundle Method Under A Frank-Wolfe Perspective
di: Fersztand, David, et al.
Pubblicazione: (2024)

New vector transport operators extending a Riemannian CG algorithm to generalized Stiefel manifold with low-rank applications
di: Wang, Xuejie, et al.
Pubblicazione: (2023)

Optimistic Bilevel Optimization with Composite Lower-Level Problem
di: Solla, Mattia, et al.
Pubblicazione: (2026)

Parallelizing the Circumcentered-Reflection Method
di: Barros, Pablo, et al.
Pubblicazione: (2025)

ZOBA: An Efficient Single-loop Zeroth-order Bilevel Optimization Algorithm
di: Rando, Marco, et al.
Pubblicazione: (2026)

Forward-Backward algorithms for weakly convex problems
di: Bednarczuk, Ewa, et al.
Pubblicazione: (2023)

Global Solutions to Non-Convex Functional Constrained Problems with Hidden Convexity
di: Fatkhullin, Ilyas, et al.
Pubblicazione: (2025)

Stochastic First-Order Methods with Non-smooth and Non-Euclidean Proximal Terms for Nonconvex High-Dimensional Stochastic Optimization
di: Xie, Yue, et al.
Pubblicazione: (2024)