Cover Image

Projected Subgradient Ascent for Convex Maximization

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Felzenszwalb, Pedro, Lee, Heon
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control Numerical Analysis 90C99
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Multiple Scale Methods For Optimization Of Discretized Continuous Functions
by: Richardson, Nicholas J. E., et al.
Published: (2025)

Kahan's Automatic Step-Size Control for Unconstrained Optimization
by: Meng, Yifeng, et al.
Published: (2025)

A Generating Polynomial Based Two-Stage Optimization Method for Tensor Rank Decomposition
by: Zheng, Zequn, et al.
Published: (2025)

Accuracy and Relationships of Quadratic Models in Derivative-free Optimization
by: Chen, Yiwen, et al.
Published: (2026)

Generalized Perron Roots and Solvability of the Absolute Value Equation
by: Radons, Manuel, et al.
Published: (2019)

A first-order method for nonconvex-nonconcave minimax problems under a local Kurdyka-Lojasiewicz condition
by: Lu, Zhaosong, et al.
Published: (2025)

Solving bilevel optimization via sequential minimax optimization
by: Lu, Zhaosong, et al.
Published: (2025)

A first-order method for nonconvex-strongly-concave constrained minimax optimization
by: Lu, Zhaosong, et al.
Published: (2025)

A first-order augmented Lagrangian method for constrained minimax optimization
by: Lu, Zhaosong, et al.
Published: (2023)

First-order penalty methods for bilevel optimization
by: Lu, Zhaosong, et al.
Published: (2023)

The Intrinsic Riemannian Proximal Gradient Method for Convex Optimization
by: Bergmann, Ronny, et al.
Published: (2025)

An accelerated primal-dual flow for linearly constrained multiobjective optimization
by: Luo, Hao, et al.
Published: (2025)

Effects of Finite-Precision Arithmetic on Interior-Point Methods for Nonlinear Programming
by: Wright, Stephen J.
Published: (2001)

Convex relaxation approaches for high-dimensional optimal transport
by: Khoo, Yuehaw, et al.
Published: (2025)

Moreau Envelope Based Difference-of-weakly-Convex Reformulation and Algorithm for Bilevel Programs
by: Gao, Lucy L., et al.
Published: (2023)

Optimal Subgradient Methods for Lipschitz Convex Optimization with Error Bounds
by: Wang, Alex L.
Published: (2025)

Chordal-NMF with Riemannian Multiplicative Update
by: Esposito, Flavia, et al.
Published: (2024)

Regularized Barzilai-Borwein method
by: An, Congpei, et al.
Published: (2022)

Proximal Nonlinear Conjugate Gradient Methods for Composite Optimization
by: Hamana, Shodai, et al.
Published: (2026)

Nesterov's Accelerated Jacobi-Type Methods for Large-scale Symmetric Positive Semidefinite Linear Systems
by: Liang, Ling, et al.
Published: (2024)

On $O(n)$ Algorithms for Projection onto the Top-$k$-sum Sublevel Set
by: Roth, Jake, et al.
Published: (2023)

Lipschitz-free Projected Subgradient Method with Time-varying Step-size
by: Xia, Yong, et al.
Published: (2024)

Convergence Rate of Projected Subgradient Method with Time-varying Step-sizes
by: Zhu, Zhihan, et al.
Published: (2024)

Convergence analysis of dynamical systems for optimization by an improved Lyapunov framework
by: Tabei, Atsushi, et al.
Published: (2026)

Stochastic Approximation Proximal Subgradient Method for Stochastic Convex-Concave Minimax Optimization
by: Dai, Yu-Hong, et al.
Published: (2024)

Optimization Problems with Nearly Convex Objective Functions and Nearly Convex Constraint Sets
by: Thieu, Nguyen Nang, et al.
Published: (2026)

Adaptive Metrics for Norm-Minimization-Based Outer Approximation in Convex Vector Optimization
by: Alshahrani, Mohammed
Published: (2026)

Asymmetric Long-Step Primal-Dual Interior-Point Methods with Dual Centering
by: Nesterov, Yurii
Published: (2025)

Existence of solutions for polyhedral convex set optimization problems
by: Löhne, Andreas
Published: (2023)

A solution method for arbitrary polyhedral convex set optimization problems
by: Löhne, Andreas
Published: (2023)

Modeling Adversarial Wildfires for Power Grid Disruption
by: Brun, Matthew, et al.
Published: (2026)

The Global R-linear Convergence of Nesterov's Accelerated Gradient Method with Unknown Strongly Convex Parameter
by: Bao, Chenglong, et al.
Published: (2023)

On the Global Minimization of the Value-at-Risk
by: Pang, Jong-Shi, et al.
Published: (2004)

A novel numerical method tailored for unconstrained optimization problems
by: Li, Lin, et al.
Published: (2025)

Tight Error Bounds for the Sign-Constrained Stiefel Manifold
by: Chen, Xiaojun, et al.
Published: (2022)

String Diagram of Optimal Transports
by: Watanabe, Kazuki, et al.
Published: (2024)

New vector transport operators extending a Riemannian CG algorithm to generalized Stiefel manifold with low-rank applications
by: Wang, Xuejie, et al.
Published: (2023)

BattOpt: Optimal Facility Planning for Electric Vehicle Battery Recycling
by: Brun, Matthew, et al.
Published: (2024)

Projected gradient descent accumulates at Bouligand stationary points
by: Olikier, Guillaume, et al.
Published: (2024)

Conservative Surrogate Models for Optimization with the Active Subspace Method
by: Luneau, Philippe-André
Published: (2024)