Computational Optimization and Applications
Publisher: Springer Nature · ISSN 0926-6003,1573-2894 · 228 articles
-
Enhancing boundary optimality in constrained Bayesian optimization via exterior barrier functions
Abstract In Bayesian optimization frameworks, expected performance indicator-based acquisition functions, such as Expected Improvement and Expected Hypervolume Improvement, are among the most widely adopted approaches for both single-...
- Joint lot-sizing and energy supply planning under renewable energy uncertainty
-
A flexible block coordinate descent method for unconstrained optimization under Hölder continuity
Abstract In this work, we propose a flexible block coordinate method for unconstrained optimization problems under Hölder continuity assumptions. The method guarantees convergence to stationary points and has worst-case complexity...
- A note on the gradient-evaluation sequence in accelerated gradient methods
- Spingarn’s method and progressive decoupling beyond elicitable monotonicity
-
Estimating lower bound functions in surrogate optimization
Abstract Lower bounds play a vital role in optimization by guiding search, improving solution quality, and quantifying optimality gaps. In expensive black-box settings, however, the quality of Lipschitz-based estimated lower bounds can...
- Quantum genetic evolutionary algorithm for discrete and continuous optimization on quantum–classical hybrid computing architectures
- Solving cyclic antibandwidth problem by SAT
- An inexact variable metric proximal linearization method for composite optimization on manifolds
-
A simultaneous approach for training neural differential-algebraic systems of equations
Abstract Neural differential-algebraic systems of equations (DAEs) are a modeling paradigm where some unknown relationships within a DAE are modeled with a neural network and learned from data. Training neural DAEs is more challenging...
-
ADMM for 0/1 D-optimality and maximum-entropy sampling relaxations
Abstract The 0/1 D-optimality problem and the maximum-entropy sampling problem are two well-known NP-hard discrete maximization problems in experimental design. Algorithms for exact optimization (of moderate-sized instances) are based...
-
Adaptive open-loop step-sizes for accelerated convergence rates of the Frank–Wolfe algorithm
Abstract Recent work has shown that, in several growth settings, the Frank–Wolfe algorithm () with fixed-parameter open-loop step-sizes $$\eta _t = \frac{\ell }{t+\ell }$$ η t = ℓ t + ℓ for $$\ell \in \mathbb {N}_{\ge 2}$$ ℓ ∈ N ≥ 2 can...
-
An outer approximation-Benders’ decomposition approach for the competitive facility location problem with limited choice rule
Abstract In this study, we propose a new exact approach to the competitive facility location problem with a limited choice rule. The problem consists in locating facilities to capture a market share that maximizes the profits of a new...
- Decision-focused predictions via pessimistic bilevel optimization: complexity and algorithms
-
A nonmonotone front descent method for bound-constrained multi-objective optimization
Abstract This paper introduces a nonmonotone extension of the Front Descent method, a state-of-the-art descent-based algorithmic framework designed to approximate the Pareto front of smooth multiobjective optimization problems. The...
-
Objective-function free multi-objective optimization: rate of convergence and performance of an Adagrad-like algorithm
Abstract We propose an Adagrad-like algorithm for multi-objective unconstrained optimization that relies on the computation of a common descent direction only. Unlike classical local algorithms for multi-objective optimization, our...
- A nonsmooth Riemannian trust-region method for multiobjective optimization with applications in machine learning problems
- Restrictive metric regularity of set-valued mappings and applications to the Newton’s method for generalized equations
-
The quadratic multidimensional knapsack problem: exact, heuristic, and machine learning methods
Abstract This paper presents a multi-faceted approach to solving the quadratic multidimensional knapsack problem (QMDKP), an NP-hard nonlinear combinatorial optimization problem that has received limited attention in the literature. We...
- Shape optimization constrained by time-dependent Stokes flow: modeling, analysis and numerical simulation
-
An inexact alternating projection method with application to matrix completion
Abstract We develop and analyze an inexact regularized alternating projection method for nonconvex feasibility problems. Such a method employs inexact projections on one of the two sets, according to a set of well-defined conditions. We...
- Bayesian optimization by kernel regression and density-based exploration
- High-resolution inertial dynamics with time-rescaled gradients for nonsmooth convex optimization
-
A general merit function-based global convergent framework for nonlinear optimization
Abstract In this paper, we revisit the convergence theory of the inexact restoration paradigm for nonlinear optimization. The paper first identifies the basic elements of a globally convergent method based on merit functions. Then, the...
-
Robust stochastic optimal control via variance penalization: application to energy management systems
Abstract This paper addresses a class of robust stochastic optimal control problems. Its main contribution lies in the introduction of a general optimization model with variance penalization and an associated solution algorithm that...
-
Local convergence of the Gauss–Newton methods for constrained nonlinear equations
Abstract We derive, from unified principles, local convergence and rate-of-convergence results for the classical Gauss-Newton method in a variety of settings. These include overdetermined and underdetermined systems of equations,...
- An adaptive cubic regularisation algorithm based on interior-point methods for optimization with general inequality constraints
-
Pareto-optimal trees and Pareto forest: a bi-objective optimization model for binary classification
Abstract As inherently transparent models, classification trees play a central role in interpretable machine learning by providing easily traceable decision paths that allow users to understand how input features contribute to specific...
- A new adaptive algorithm for competitive group testing
-
Forward–backward splitting in bilaterally bounded Alexandrov spaces
Abstract With the goal of solving optimisation problems on non-Riemannian manifolds, such as geometrical surfaces with sharp edges, we develop and prove the convergence of a forward–backward method in Alexandrov spaces with curvature...