Computational Optimization and Applications
Publisher: Springer Nature · ISSN 0926-6003,1573-2894 · 228 articles
- Error control and Neyman–Pearson classification with buffered probability and support vectors
-
Active set-based inexact proximal bundle algorithm for stochastic quadratic programming
Abstract In this paper, we examine two-stage stochastic quadratic programming problems, where the objective functions of the first and second stages are quadratic, and the constraints are linear. The uncertainty is associated with the...
- A general framework for inexact splitting algorithms with relative errors and applications to Chambolle–Pock and Davis–Yin methods
- A simple and effective exact method for the medianoid problem with multipurpose trips
- Preface: global optimization algorithms and applications
- A shape optimization approach for a Batchelor flow problem
- An overview and comparison of spectral bundle methods for primal and dual semidefinite programs
-
Convergence rates for an inexact linearized ADMM for nonsmooth nonconvex optimization with nonlinear equality constraints
Abstract In this paper, we consider nonconvex optimization problems with nonsmooth nonconvex objective function and nonlinear equality constraints. We assume that both the objective function and the functional constraints can be...
- Global convergence analysis of the power proximal point and augmented Lagrangian method
-
prunAdag: an adaptive pruning-aware gradient method
Abstract A pruning-aware adaptive gradient method is proposed which classifies the variables in two sets before updating them using different strategies. This technique extends the “relevant/irrelevant" approach of Ding et al. (Adv...
- A heuristic algorithm for the cluster editing problem
-
Conditional gradients for total variation regularization with PDE constraints: a graph cuts approach
Abstract Total variation regularization has proven to be a valuable tool in the context of optimal control of differential equations. This is particularly attributed to the observation that TV-penalties often favor piecewise constant...
- Formulations and algorithms for the simple cycle problem
-
Behavioral portfolio optimization via cumulative prospect theory with a symmetric alternating direction method of multipliers
Abstract Amidst prevailing uncertainties in investment landscapes and heterogeneous investor risk attitudes toward gains and losses, this study investigates behavioral portfolio selection under a flexible investment horizon. We employ...
-
Probabilistic iterative hard thresholding for sparse learning
Abstract For statistical modeling wherein the data regime is unfavorable in terms of dimensionality relative to the sample size, finding hidden sparsity in the relationship structure between variables can be critical in formulating an...
- Accelerated forward-backward algorithms with subgradient corrections
-
Learning to accelerate tightening of convex relaxations of the AC optimal power flow problem
Abstract We propose a novel machine learning (ML)-based approach to significantly reduce the run times of the optimality-based bound tightening (OBBT) algorithm for strengthening the convex relaxations of the non-convex Alternating...
- Risk-averse constrained blackbox optimization under mixed aleatory/epistemic uncertainties
-
An overview of absolute value equations: from theory to solution methods and challenges
Abstract This paper provides a comprehensive examination of the absolute value equations $$Ax-|x|=b$$ , a deceptively simple formulation that has attracted significant research interest in recent years. This problem is NP-hard and...
- A reconsideration of quasimonotone variational inequality problems
-
Variable metric proximal stochastic gradient methods with additional sampling
Abstract Regularized empirical risk minimization problems arise in a variety of applications, including machine learning, signal processing, and image processing. Proximal stochastic gradient algorithms are a standard approach to solve...
- Convergence of the majorized PAM method with subspace correction for low-rank composite factorization model
- Preprocessing and valid inequalities for exact detection of critical nodes via integer programming
- Refining asymptotic complexity bounds for nonconvex optimization methods, including why steepest descent is $$o(\epsilon ^{-2})$$ rather than $$\mathcal{O}(\epsilon ^{-2})$$
- A novel global algorithm for optimal portfolio selection with maximum relative marginal risk via SCO method and SOCP relaxation
-
The Capacitated Vehicle Routing Problem with Planned Downtime
Abstract The Capacitated Vehicle Routing Problem with Planned Downtime introduced in this work is a generalization of the classical vehicle routing problem in which two sets of routes have to be jointly designed: one set considering...
- A proximal gradient method with an explicit line search for multiobjective optimization
- On the robust isolated calmness of a class of nonsmooth optimizations on Riemannian manifolds and its applications
- A Subspace Minimization Barzilai-Borwein Method for Multiobjective Optimization Problems
-
Efficient training of Gaussian processes with tensor product structure
Abstract To determine the optimal set of hyperparameters of a Gaussian process based on a large number of training data, both a linear system and a trace estimation problem must be solved. In this paper, we focus on establishing...