In the Triangle-Free (Simple) 2-Matching problem we are given an undirected graph $$G=(V,E)$$. Our goal is to compute a maximum-cardinality $$M\subseteq E$$ satisfying the following properties: (1) at most two edges of M are incident on each node (i.e., M is a 2-matching) and (2) M does not induce any triangle. Recently, Hartvigsen [J. Graph Theory 2024] published a complex polynomial-time algorithm for this problem, with a very complex analysis (spanning over 100 pages). This result was originally announced in his Ph.D. thesis from 1984. In this paper we have a fresh look at this problem and present a simple PTAS for it based on local search. Our PTAS exploits the fact that, as long as the current solution is far enough from the optimum, there exists a short augmenting trail (similar to the maximum matching case).
An algorithm based on the interior-point methodology for solving continuous nonlinearly constrained optimization problems is proposed, analyzed, and tested. The distinguishing feature of the algorithm is that it presumes that only noisy...
Introduced by Beck and Teboulle in [1], FISTA (Fast Iterative Shrinkage-Thresholding Algorithm) is a first-order method widely used in convex optimization. Adapted from Nesterov’s accelerated gradient method for convex functions [2],...
The progressive decoupling algorithm solves problems of optimization by iteratively suppressing complications coming from linear linkage relations. Here its formulation is significantly extended and a sharper theory of convergence is...
This paper introduces a class of two-stage stochastic minimax problems where the first-stage objective function is nonconvex-concave while the second-stage objective function is strongly convex-concave. We establish properties of the...
Inspired by Von Neumann’s foundational work on expected utility, this paper extends the data-driven expected utility maximization framework under constant absolute risk aversion (CARA) preferences by incorporating nonlinear payoff...