A partitioned optimization framework for structure-aware problems
From MaRDI portal
Cites work
- A partition-based global optimization algorithm
- A progressive barrier for derivative-free nonlinear programming
- A survey of contextual optimization methods for decision-making under uncertainty
- Active subspaces. Emerging ideas for dimension reduction in parameter studies
- Algorithm 1027: NOMAD Version 4: Nonlinear Optimization with the MADS Algorithm
- An Implicit-Function Theorem for a Class of Nonsmooth Functions
- An Introduction to Optimization on Smooth Manifolds
- Bilevel optimization and variational analysis
- Bilevel optimization. Advances and next challenges
- Convergence towards a local minimum by direct search methods with a covering step
- Derivative-free and blackbox optimization
- Derivative-free optimization methods
- Direct search based on probabilistic descent
- Direct Search Based on Probabilistic Descent in Reduced Spaces
- Functional analysis, calculus of variations and optimal control
- Global convergence rate analysis of unconstrained optimization methods based on probabilistic models
- scientific article; zbMATH DE number 3167340 (Why is no real title available?)
- Manifold sampling for optimizing nonsmooth nonconvex compositions
- Mesh Adaptive Direct Search Algorithms for Constrained Optimization
- Optimal control
- Optimal control theory. Applications to management science and economics
- Separable optimization. Theory and methods
- Sequential Learning of Active Subspaces
- Structure-Aware Methods for Expensive Derivative-Free Nonsmooth Composite Optimization
- The DIRECT algorithm: 25 years later
- Two decades of blackbox optimization applications
This page was built for publication: A partitioned optimization framework for structure-aware problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7293281)
