Results 11 to 20 of about 124 (120)
Second-Order Online Nonconvex Optimization [PDF]
We present the online Newton's method, a single-step second-order method for online nonconvex optimization. We analyze its performance and obtain a dynamic regret bound that is linear in the cumulative variation between round optima. We show that if the variation between round optima is limited, the method leads to a constant regret bound.
Antoine Lesage-Landry +2 more
openaire +3 more sources
Nonconvex nonsmooth optimization via convex–nonconvex majorization–minimization [PDF]
The authors present a majorization-minimization approach based on a novel convex-nonconvex upper bounding strategy for the solution of certain classes of nonconvex nonsmooth optimization problems. They propose an efficient algorithm for minimizing the (convex) surrogate function based on the alternating direction method of multipliers.
LANZA, ALESSANDRO +3 more
openaire +3 more sources
Nonconvex Phase Synchronization [PDF]
29 pages, 7 figures, to appear in SIAM Journal of Optimization (2016)
openaire +2 more sources
Nonconvex compressive video sensing [PDF]
High-speed cameras explore more details than normal cameras in the time sequence, while the conventional video sampling suffers from the trade-off between temporal and spatial resolutions due to the sensor's physical limitation. Compressive sensing overcomes this obstacle by combining the sampling and compression procedures together.
Liangliang, Chen +7 more
openaire +2 more sources
Data‐Driven Bulldozer Blade Control for Autonomous Terrain Leveling
A simulation‐driven framework for autonomous bulldozer leveling is presented, combining high‐fidelity terramechanics simulation with a neural‐network‐based reduced‐order model. Gradient‐based optimization enables efficient, low‐level blade control that balances leveling quality and operation time.
Harry Zhang +5 more
wiley +1 more source
A “Nonconvex+Nonconvex” approach for image restoration with impulse noise removal
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cui, Zhuo-Xu, Fan, Qibin
openaire +2 more sources
Fixed Points in Nonconvex Domains [PDF]
A lemma of Janos is used to prove that nonexpansive self-maps which “shrink” a compact set X away from its boundary in co ¯ X \overline {{\text {co}}} \;X have fixed points in X.
Chandler, Eric, Faulkner, Gary
openaire +1 more source
Graph‐based imitation and reinforcement learning for efficient Benders decomposition
Abstract This work introduces an end‐to‐end graph‐based agent for accelerating the computational efficiency of Benders Decomposition. The agent's policy is parameterized by a graph neural network, which takes as input a bipartite graph representation of the master problem and proposes a candidate solution.
Bernard T. Agyeman +3 more
wiley +1 more source
Deep Learning‐Assisted Design of Mechanical Metamaterials
This review examines the role of data‐driven deep learning methodologies in advancing mechanical metamaterial design, focusing on the specific methodologies, applications, challenges, and outlooks of this field. Mechanical metamaterials (MMs), characterized by their extraordinary mechanical behaviors derived from architected microstructures, have ...
Zisheng Zong +5 more
wiley +1 more source
A physics‐guided machine learning framework estimates Young's modulus in multilayered multimaterial hyperelastic cylinders using contact mechanics. A semiempirical stiffness law is embedded into a custom neural network, ensuring physically consistent predictions. Validation against experimental and numerical data on C.
Christoforos Rekatsinas +4 more
wiley +1 more source

