Applied Nanoscience
Издатель: Springer Nature · 19 статей
-
An interior-point algorithm for continuous nonlinearly constrained optimization with noisy function and derivative evaluations
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...
-
Strong convergence of FISTA iterates under Hölderian and quadratic growth conditions
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],...
-
Solutions of two-stage stochastic minimax problems
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...
-
Advances in progressive decoupling methodology for problem decomposition in optimization
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...
-
Robust Data-Driven CARA Optimization
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...
-
Envelopes of sets and functions via algebraic closings and openings on complete lattices
This paper develops a unified lattice-theoretic framework for envelope constructions of sets and extended real-valued functions. Given a subset $$\mathcal {F}$$ of a complete lattice $${\mathcal {E}}$$, we associate with $$\mathcal...
-
Unsplittable multicommodity flows in outerplanar graphs
We consider the problem of multicommodity flows in outerplanar graphs. Okamura and Seymour [8] showed that the cut-condition is sufficient for routing demands in outerplanar graphs. We consider the unsplittable version of the problem...
-
The adaptive integrated mean: a novel perspective for acceleration and its extension to Bregman first-order methods
We introduce the Adaptive Integrated Mean (AIM), a novel perspective on acceleration in first-order methods that interprets fast convergence as the result of an adaptive mean integrated directly into the optimization step. Within this...
-
A PTAS for triangle-free 2-matching
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...
-
Online proportional apportionment
Traditionally, the problem of apportioning the seats of a legislative body has been viewed as a one-shot process with no dynamic considerations. While this approach is reasonable for some instances of the problem, dynamic aspects play...
-
Augmented Lagrangian methods for infeasible convex optimization problems and diverging proximal-point algorithms
This work investigates the convergence behavior of augmented Lagrangian methods (ALMs) when applied to convex optimization problems that may be infeasible. ALMs are a popular class of algorithms for solving constrained optimization...
-
Real-weighted general factors on subcubic graphs
General factors generalize the concept of graph matchings and have been extensively studied in combinatorial optimization. Given a graph G where each vertex v is assigned a set $$\pi (v)$$ of feasible degrees (called a degree...
-
Minimax-optimal Halpern iterations for Lipschitz maps
This paper investigates the minimax-optimality of Halpern fixed-point iterations for Lipschitz maps in general normed spaces. Starting from an a priori bound on the orbit of iterates, we derive non-asymptotic estimates for the...
-
On integer programs with irrational data
An integer program (IP) with a finite number of feasible solutions may have an unbounded continuous relaxation if it contains irrational parameters, due to implicit constraints induced by those irrational numbers. For IPs with...
-
Coderivative-Based Newton Methods in Structured Nonconvex and Nonsmooth Optimization
This paper proposes and develops new Newton-type methods to solve structured nonconvex and nonsmooth optimization problems with justifying their fast local and global convergence by means of advanced tools of variational analysis and...
-
A first-order method for constrained nonconvex-nonconcave minimax optimization
We study a class of constrained nonconvex-nonconcave minimax optimization problems in which the inner maximization involves potentially complex constraints. Under the assumption that the inner problem of a novel lifted minimax...
-
Rank conditions for exactness of semidefinite relaxations in polynomial optimization
We consider the Moment-SOS hierarchy in polynomial optimization. We first provide a sufficient condition to solve the truncated $$\textbf{K}$$-moment problem associated with a given degree-2 n pseudo-moment sequence $$\varvec{\phi }^n$$...
-
A Tight SDP Relaxation for the Cubic-Quartic Regularization Problem
This paper studies how to compute global minimizers of the cubic-quartic regularization (CQR) problem $$ \min _{s \in \mathbb {R}^n} \quad f_0+g^Ts+\frac{1}{2}s^THs+\frac{\beta }{6}\Vert s \Vert ^3+ \frac{\sigma }{4} \Vert s\Vert ^4, $$...
-
H-invariance theory: a complete characterization of minimax optimal fixed-point algorithms
For nonexpansive fixed-point problems, Halpern’s method with optimal parameters, its so-called H-dual algorithm, and in fact, an infinite family of algorithms containing them, all exhibit the exact minimax optimal convergence rate. In...