Computational Optimization and Applications
Издатель: Springer Nature · ISSN 0926-6003,1573-2894 · 228 статей
- An efficient linearization approach for project portfolio selection problems considering project interdependencies
-
Revisiting implicit variables in mathematical optimization: simplified modeling and a numerical evidence
Abstract Implicit variables of an optimization problem are used to model variationally challenging feasibility conditions in a tractable way while not entering the objective function. Hence, it is a standard approach to treat implicit...
- A relaxed scalable modulus-based matrix splitting method for vertical nonlinear complementarity problems
-
Learning to locate p-hubs in situations of changes in flow
Abstract The p -hub median problem is central to location science, with multiple applications in network design. Given a set of nodes, each of them sends and receives some flow to and from the other nodes. Among these nodes, p have to...
- Constraint hypergraph partitioning problems via recursive bipartition algorithm based on improved Dai–Kou conjugate gradient algorithm
- Mirror descent algorithm for stochastic multi-objective optimization and its application to machine learning
- On the convergence and complexity of proximal gradient and accelerated proximal gradient methods under adaptive gradient estimation
- A restricted memory quasi-Newton bundle method for nonsmooth optimization on Riemannian manifolds
-
On constraint qualifications for non-relaxable sets and an augmented Lagrangian method
Abstract In this paper we consider an augmented Lagrangian method with general lower-level constraints, that is, where some of the constraints are penalized while others are kept as subproblem constraints. Motivated by some recent...
- Accelerated windowing for the crew rostering problem with machine learning
- Accelerated nonnegative proximal gradient algorithm for sparse linear complementarity problem
-
A mathematical programming approach to hierarchical clustering
Abstract Hierarchical clustering is a statistical technique for analyzing the existing groups (clusters) within a dataset and constructing a hierarchy of clusters. This is represented by a rooted tree (dendrogram) whose leaves...
-
A speed up strategy for gradient methods
Abstract In this paper, we propose a new acceleration strategy for gradient-based methods applied to strictly convex Quadratic Programming (QP) problems. The strategy consists in performing, at selected iterations, minimization steps...
- A more efficient reformulation of complex SDP as real SDP
- A natural SQP method with potentially infeasible subproblems for nonlinear optimization
- Subgradient-based tableau pivot method for sparse signal recovery
- A derivative-free Levenberg–Marquardt method for sparse nonlinear least squares problems
- Computing the convex envelope of bivariate piecewise linear-quadratic functions in linear time
- Tractable hierarchies of convex relaxations for polynomial optimization on the nonnegative orthant
-
A unified optimization framework for multiclass classification with structured hyperplane arrangements
Abstract In this paper, we propose a new mathematical optimization model for multiclass classification based on arrangements of hyperplanes. Our approach preserves the core support vector machine (SVM) paradigm of maximizing class...
- Revisiting Extragradient-Type Methods: Part 1—Generalizations and Sublinear Convergence Rates
- A second-order descent method with active-set prediction for group-sparse optimization
- FIRM: federated image reconstruction using multimodal tomographic data
-
Effectively leveraging momentum terms in stochastic line search frameworks for fast optimization of finite-sum problems
Abstract In this work, we address unconstrained finite-sum optimization problems, with particular focus on instances originating in large scale deep learning scenarios. Our main interest lies in the exploration of the relationship...
- Structured nonsmooth optimization using functional encoding and branching information
-
Parallel block coordinate descent methods with identification strategies
Abstract This work presents a parallel variant of the algorithm introduced in [ Acceleration of block coordinate descent methods with identification strategies , Comput. Optim. Appl. 72(3):609–640, 2019] to minimize the sum of a...
-
Exact and heuristic algorithms for constrained biclustering
Abstract Biclustering, also known as co-clustering or two-way clustering, simultaneously partitions the rows and columns of a data matrix to reveal submatrices with coherent patterns. Incorporating background knowledge into clustering...
- A symmetric primal-dual method with double extrapolation for composite convex optimization involving three functions
- Weighting method for non-preemptive multi-objective mathematical programming
- Efficient gradient tracking algorithms for distributed optimization problems with inexact communication