Computational Optimization and Applications
Издатель: Springer Nature · ISSN 0926-6003,1573-2894 · 228 статей
- General inertial proximal gradient method with gradient extrapolation for nonconvex nonsmooth optimization problems
- Verifying Robustness of Neural Networks with Tight Semidefinite Relaxations
- Scalable approximate optimal diagonal preconditioning
- An improved convergence guarantee for the gradient-push algorithm with a constant stepsize
-
Domain decomposition for entropic unbalanced optimal transport
Abstract Entropic optimal transport has become a popular tool in data analysis and it can be solved efficiently with the celebrated Sinkhorn algorithm, but large scale problems remain challenging. Domain decomposition has been shown to...
- A linesearch-type normal map-based semismooth Newton method for nonsmooth nonconvex composite optimization
-
Exploiting negative curvature in conjunction with adaptive sampling: theoretical results and a practical algorithm
Abstract In this paper, we propose algorithms that exploit negative curvature for solving noisy nonlinear nonconvex unconstrained optimization problems. We consider both deterministic inexact and stochastic settings, and develop...
- Discrete Fick’s law algorithm with new transfer function and aggregation optimization strategy for solving multiple knapsack problem
- Sample average approximation for portfolio optimization under CVaR constraint in a (re)insurance context
- Shape and topology optimization for elasticity system using shape gradients and topological derivatives
- New restricted isometry properties of constrained and unconstrained $$L_{*-F}$$ minimization for low-rank approximation
- The golden ratio primal-dual algorithm with two new stepsize rules for convex-concave saddle point problems
-
Shape optimization of polytopes and application to the polyhedral Saint–Venant inequality
Abstract We introduce a framework for shape optimization in the class of simple polytopes in arbitrary dimensions. We use a parametrization via hyperplanes and provide conditions for stability of simple polytopes under small...
- Distributionally robust optimization problem with probabilistic envelope constraints over Wasserstein ball
- A derivative-free approach to mixed integer constrained multiobjective nonsmooth black-box optimization
- A line search framework with restarting for noisy optimization problems
- Inexact FISTA-like Methods with Adaptive Backtracking
-
Quantitative results for a Tseng-type primal-dual method for composite monotone inclusions
Abstract We provide quantitative results on a seminal Tseng-type primal-dual splitting algorithm for solving monotone inclusions due to Combettes and Pesquet which involves a mixture of sums, linear compositions and parallel sums of...
-
A preconditioned inexact infeasible quantum interior point method for linear optimization
Abstract Quantum Interior Point Methods (QIPMs) have been attracting significant interests recently due to their potential of solving optimization problems substantially faster than state-of-the-art conventional algorithms. In general,...
-
A globally convergent gradient method with momentum
Abstract In this work, we consider smooth unconstrained optimization problems and we deal with the class of gradient methods with momentum, i.e., descent algorithms where the search direction is defined as a linear combination of the...
- A nonlinear conjugate gradient algorithm for multiobjective optimization: multiple hybrid search direction and global rates
- Error bounds and Newton-type methods for reformulations of Karush–Kuhn–Tucker systems of mathematical programs with complementarity constraints
- Multi-objective k-way parallel hypergraph partitioning with proximal gradient algorithm
- Symplectic discretization approach for developing new proximal point algorithm
- Transformations of variables and transformations of equations via the perturbed Newton method framework
-
A globalized inexact semismooth Newton method for nonsmooth fixed-point equations involving variational inequalities
Abstract We develop a semismooth Newton framework for the numerical solution of fixed-point equations that are posed in Banach spaces. The framework is motivated by applications in the field of obstacle-type quasi-variational...
- Extrapolated hard thresholding algorithms with finite length for composite $$\ell _0$$ penalized problems
- COAP 2024 best paper prize: paper of M. Locatelli
-
Derivative-free stochastic bilevel optimization for inverse problems
Abstract Inverse problems are key issues in several scientific areas, including signal processing and medical imaging. Data-driven approaches for inverse problems aim for learning model and regularization parameters from observed data...
- COAP 2024 best paper prize: paper of Y. Diouane, V. Kungurtsev, F. Rinaldi, and D. Zeffiro