Computational Optimization and Applications
Издатель: Springer Nature · ISSN 0926-6003,1573-2894 · 228 статей
- COAP 2025 best paper prize: paper of C. Buchheim, A. Grütering, and C. Meyer
- COFF_IG: controlled quasi objective function free incremental gradient
- Revisiting extragradient-type methods: part 2—generalization and unified convergence analysis of anchored extragradient-type variants
- ProxSTORM—a stochastic trust-region algorithm for nonsmooth optimization
- Decentralized stochastic zeroth-order conjugate gradient algorithm for nonconvex optimization
- Contextual scenario generation for two-stage stochastic programming
-
The dual IRLS scheme for (hyper-)graph p-Laplacians and $$\ell ^p$$ regression with large exponents
Abstract We introduce an iterative scheme for discrete convex minimization problems of p -Laplace type such as variational graph p -Laplace problems and $$\ell ^p$$ ℓ p regression. In each iteration, the scheme solves only a weighted...
- Efficient QUIC-based inexact iterative reweighting for sparse inverse covariance estimation with nonconvex regularization
- Adaptive primal dual hybrid gradient algorithms based on average spectrum for saddle point problems
- Augmentation algorithms for integer programs with total variation-like regularization
- Solving 0–1 integer programs with unknown knapsack constraints using membership oracles
-
Reinforcement learning for adaptive interior point methods in convex quadratic programming
Abstract Quadratic programming is a workhorse of modern nonlinear optimization, control, and data science. Although regularized methods offer convergence guarantees under minimal assumptions on the problem data, they can exhibit the...
- ItsDEAL: inexact two-level smoothing descent algorithms for weakly convex optimization
- Nonmonotone subgradient methods based on a local descent lemma
-
A cubic regularization method for multiobjective optimization
Abstract This work introduces a new cubic regularization method for solving nonconvex unconstrained multiobjective optimization problems. At each iteration of the method, a model associated with the cubic regularization of each...
-
An adaptive line-search-free multiobjective gradient method and its iteration-complexity analysis
Abstract This work introduces an adaptive line-search-free multiobjective gradient (AMG) method for solving smooth multiobjective optimization problems. The proposed approach automatically adjusts stepsizes based on steepest descent...
-
Solving two-stage stochastic programming problems using alternating direction method of multipliers
Abstract This study introduces a proximal three-block Alternating Direction Method of Multipliers (ADMM) variant with a projected dual update for solving two-stage stochastic programming problems. We first recast the two-stage...
- Discrete approximation for a class of stochastic hierarchical optimization problems
-
A proximal augmented Lagrangian method for nonconvex optimization with equality and inequality constraints
Abstract We propose an inexact proximal augmented Lagrangian method (P-ALM) for solving nonconvex structured optimization problems. The proposed method features an easily implementable rule not only for updating the penalty parameters,...
- Complexity guarantees and polling strategies for Riemannian direct-search methods
- A proximal stochastic variance reduced zeroth-order algorithm using structured finite-differences
- A third-order dynamical system for generalized inverse mixed variational inequality problems
- On the solvability of SOCCPs via smoothing Levenberg–Marquardt approach under local error bound
- Lipschitz-free mirror descent methods for non-smooth optimization problems
-
A variable smoothing for weakly convex composite minimization with manifold constraint via parametrization
Abstract In this paper, we address a manifold constrained nonsmooth optimization problem involving the composition of a weakly convex function and a smooth mapping under the availability of a parametrization of the manifold. To find a...
- Strong convergence of a golden ratio proximal algorithm for equilibrium problems with extended parameter range
-
A stochastic Galerkin method for optimal Dirichlet boundary control problems with uncertain data
Abstract The paper deals with a stochastic Galerkin approximation of elliptic Dirichlet boundary control problems with random input data. The expectation of a tracking-type cost functional with deterministic constrained control is...
-
A globally convergent method for computing B-stationary points of mathematical programs with equilibrium constraints
Abstract This paper introduces a computationally efficient method that converges globally to B-stationary points of mathematical programs with equilibrium constraints (MPECs). B-stationarity is necessary for optimality and means that no...
- Averaged proximal reflected gradient method for monotone variational inequalities
- Lipschitz continuously smoothing accelerated proximal gradient method