Computational Optimization and Applications
Издатель: Springer Nature · ISSN 0926-6003,1573-2894 · 228 статей
- New biconvex optimization for planning of battery energy storage systems
- Quadratic convex reformulations for a class of complex quadratic programming problems
- Regularized standard polynomial programming formulations for the maximum clique problem
- The $$\omega $$-condition number: applications to preconditioning and low rank generalized Jacobian updating
- A symmetric version of the generalized Chambolle-Pock-He-Yuan method for saddle point problems
-
On a family of relaxed gradient descent methods for strictly convex quadratic minimization
Abstract This paper studies the convergence properties of a family of Relaxed $$\ell $$ ℓ -Minimal Gradient Descent methods for quadratic optimization; the family includes the omnipresent Steepest Descent method, as well as the Minimal...
-
Distributed inexact Newton method with adaptive step sizes
Abstract We consider two formulations for distributed optimization wherein N nodes in a generic connected network solve a problem of common interest: distributed personalized optimization and consensus optimization. A new method termed...
- Speeding up L-BFGS by direct approximation of the inverse Hessian matrix
-
Finding search directions in quasi-Newton methods for minimizing a quadratic function subject to uncertainty
Abstract We investigate quasi-Newton methods for minimizing a strongly convex quadratic function which is subject to errors in the evaluation of the gradients. In particular, we focus on computing search directions for quasi-Newton...
-
Convergence of ease-controlled random reshuffling gradient algorithms under Lipschitz smoothness
Abstract In this work, we consider minimizing the average of a very large number of smooth and possibly non-convex functions, and we focus on two widely used minibatch frameworks to tackle this optimization problem: incremental gradient...
-
A mixed-integer PDE-constrained optimization formulation for constructing electromagnetic cloaks with multiple materials
Abstract We study the design of an electromagnetic cloak from multiple materials with an additional constraint on the mass of the cloak. Our problem is an example of a topology optimization problem, and we formulate this problem as a...
-
Spectral stochastic gradient method with additional sampling for finite and infinite sums
Abstract In this paper, we propose a new stochastic gradient method for numerical minimization of finite sums. We also propose a modified version of this method applicable on more general problems referred to as infinite sum problems,...
- Inertial accelerated stochastic mirror descent for large-scale generalized tensor CP decomposition
-
A Scaled Gradient Projection method for the realization of the balancing principle in TGV-based image restoration
Abstract In the last few years, Total Generalized Variation (TGV) regularization has proved to be a valuable tool to remove blur and noise from an image while avoiding the staircase effect typical of the Total Variation (TV) and...
- On a globally convergent semismooth* Newton method in nonsmooth nonconvex optimization
-
On the convergence of the gradient descent method with stochastic fixed-point rounding errors under the Polyak–Łojasiewicz inequality
Abstract In the training of neural networks with low-precision computation and fixed-point arithmetic, rounding errors often cause stagnation or are detrimental to the convergence of the optimizers. This study provides insights into the...
- Proximal gradient method for convex multiobjective optimization problems without Lipschitz continuous gradients
-
Regularized methods via cubic model subspace minimization for nonconvex optimization
Abstract Adaptive cubic regularization methods for solving nonconvex problems need the efficient computation of the trial step, involving the minimization of a cubic model. We propose a new approach in which this model is minimized in a...
-
On the use of restriction of the right-hand side in spatial branch-and-bound algorithms to ensure termination
Abstract Spatial branch-and-bound algorithms for global minimization of non-convex problems require both lower and upper bounding procedures that finally converge to a globally optimal value in order to ensure termination of these...
-
Exploiting effective negative curvature directions via SYMMBK algorithm, in Newton–Krylov methods
Abstract In this paper we consider the issue of computing negative curvature directions, for nonconvex functions, within Newton–Krylov methods for large scale unconstrained optimization. In the last decades this issue has been widely...
- All saddle points for polynomial optimization
- On the well-posedness of tracking Dirichlet data for Bernoulli free boundary problems
-
Ultra-small world detection in networks: subgraphs with prescribed distance distributions
Abstract We introduce a class of distance-based clique relaxation models, which enforce certain distributions on vertex pairwise distances in the corresponding induced subgraphs. Both “local” and “global” versions of the proposed...
-
Parabolic optimal control problems with combinatorial switching constraints, part III: branch-and-bound algorithm
Abstract We present a branch-and-bound algorithm for globally solving parabolic optimal control problems with binary switches that have bounded variation and possibly need to satisfy further combinatorial constraints. More precisely,...
- Cardinality constrained mean-variance portfolios: a penalty decomposition algorithm
- Improving the stochastically controlled stochastic gradient method by the bandwidth-based stepsize
-
A second-order sequential optimality condition for nonlinear second-order cone programming problems
Abstract In the last two decades, the sequential optimality conditions, which do not require constraint qualifications and allow improvement on the convergence assumptions of algorithms, had been considered in the literature. It...
- A convex combined symmetric alternating direction method of multipliers for separable optimization
- Strong global convergence properties of algorithms for nonlinear symmetric cone programming
- An arc-search interior-point algorithm for nonlinear constrained optimization