paper-with-me

홈 › Papers

WANCO: Weak Adversarial Networks for Constrained Optimization problems

2024-07-04 · Gang Bao, Dong Wang, Boyi Zou

This paper focuses on integrating the networks and adversarial training into constrained optimization problems to develop a framework algorithm for constrained optimization problems. For such problems, we first transform them into minimax problems using the augmented Lagrangian method and then use two (or several) deep neural networks(DNNs) to represent the primal and dual variables respectively. The parameters in the neural networks are then trained by an adversarial process. The proposed architecture is relatively insensitive to the scale of values of different constraints when compared to penalty based deep learning methods. Through this type of training, the constraints are imposed better based on the augmented Lagrangian multipliers. Extensive examples for optimization problems with scalar constraints, nonlinear constraints, partial differential equation constraints, and inequality constraints are considered to show the capability and robustness of the proposed method, with applications ranging from Ginzburg--Landau energy minimization problems, partition problems, fluid-solid topology optimization, to obstacle problems.

📄 PDF Abstract BibTeX arXiv:2407.03647

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Memory-Constrained No-Regret Learning in Adversarial Bandits

2020-02-26 · Xiao Xu, Qing Zhao

An adversarial bandit problem with memory constraints is studied where only the statistics of a subset of arms can be stored. A hierarchical learning policy that requires only a sublinear order of memory space in terms o…

Convergence of adaptive algorithms for weakly convex constrained optimization

2020-06-11 · Ahmet Alacaoglu, Yura Malitsky, Volkan Cevher

We analyze the adaptive first order algorithm AMSGrad, for solving a constrained stochastic optimization problem with a weakly convex objective. We prove the $\mathcal{\tilde O}(t^{-1/4})$ rate of convergence for the nor…

Stochastic Optimization

Convergence of adaptive algorithms for constrained weakly convex optimization

2021-12-01 · NeurIPS 2021 12 · Ahmet Alacaoglu, Yura Malitsky, Volkan Cevher

We analyze the adaptive first order algorithm AMSGrad, for solving a constrained stochastic optimization problem with a weakly convex objective. We prove the $\mathcal{\tilde O}(t^{-1/2})$ rate of convergence for the squ…

Stochastic Optimization

Time-Dependent PDE-Constrained Optimization via Weak-Form Latent Dynamics

2026-05-20 · April Tran, Terry Haut, David Bortz, Youngsoo Choi arxiv

Optimization problems constrained by high-dimensional, time-dependent partial differential equations require repeated forward and sensitivity solves, making high-fidelity optimization computationally prohibitive in many-…

Oracle Complexity of Single-Loop Switching Subgradient Methods for Non-Smooth Weakly Convex Functional Constrained Optimization

2023-01-30 · NeurIPS 2023 11

We consider a non-convex constrained optimization problem, where the objective function is weakly convex and the constraint function is either convex or weakly convex. To solve this problem, we consider the classical swi…