Aug 2026· Mathematics· Vol 14, pp. 2751· 0 citations· 36 references
TL;DR
This paper addresses the unconstrained global minimization of continuously differentiable functions by introducing a novel global optimization framework based on the auxiliary function approach, and develops two new local-search-based algorithms that offer superior performance and robustness.
Abstract
This paper addresses the unconstrained global minimization of continuously differentiable functions by introducing a novel global optimization framework based on the auxiliary function approach. First, a robust auxiliary function that remains unaffected by parameter variations is proposed. Building upon this formulation, two new local-search-based algorithms are developed, and their numerical stabilization is thoroughly analyzed. To validate the efficiency and real-world applicability of the proposed approach, the algorithms are evaluated on standard benchmark functions as well as the challenging 25-bar space truss weight optimization problem. Comparative analyses with state-of-the-art methods demonstrate that the proposed algorithms offer superior performance and robustness.
We introduce an anytime, almost parameter-free algorithm for convex function-constrained optimization, in which the objective and constraint functions are unknown piecewise-smooth. Our algorithm, Restarted Penalty APEX (Penalty Accelerated Prox-level method for Exploring Piecewise Smoothness), is an accelerated bundle-...
We introduce Envelopt, a globally convergent iterative framework for a broad class of structured optimization problems where a smooth objective is augmented by a nonsmooth convex regularizer composed with a smooth mapping, and the variables are subject to general smooth constraints. All smooth functions may be nonconve...
This paper introduces a variational control principle grounded in the minimization of free energy on Riemannian manifolds. Unlike classical approaches that treat stability, constraints, and adaptation as separate problems, the proposed framework integrates them into a single variational principle. Control laws, includi...
I. Zaitceva· IEEE Control Systems Letters· 0 citations
This paper studies stochastic algorithms for minimizing paraconvex functions, a function class that generalizes weakly convex functions and includes, for instance, H\"older smooth functions and compositions of convex functions with H\"older smooth maps. We first establish the convergence of the stochastic subgradient m...
A globally convergent regularized Newton method with positive definite regularization for solving nonsmooth optimization problems that replaces the identity matrix in traditional algorithms with a general positive-definite symmetric matrix to regularize the generalized Hessian.