Cover Image

Lagrangian Dual Sections: A Topological Perspective on Hidden Convexity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Chandrasekaran, Venkat, Duff, Timothy, Rodriguez, Jose Israel, Shu, Kevin
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Spectral Methods for Polynomial Optimization
by: Moreno, Elvira, et al.
Published: (2025)

Dimension-Free Descriptions of Convex Sets
by: Levin, Eitan, et al.
Published: (2023)

Rate-Cost Tradeoffs in Nonlinear Control
by: Atay, Eray Unsal, et al.
Published: (2026)

Hidden Convexity in Queueing Models
by: Chen, Xin, et al.
Published: (2025)

Poset-Markov Channels: Capacity via Group Symmetry
by: Atay, Eray Unsal, et al.
Published: (2025)

Two Innovations in Inexact Augmented Lagrangian Methods for Convex Optimization
by: Eckstein, Jonathan, et al.
Published: (2025)

Global Convergence of Control-Based Lagrangian Flows for Non-Convex Optimization
by: Pirrera, Simone, et al.
Published: (2026)

Variable Aggregation-based Perspective Reformulation for Mixed-Integer Convex Optimization with Symmetry
by: Wu, Junhao, et al.
Published: (2026)

Hidden Convexity-Based Distributed Operation of Integrated Electricity-Gas Systems
by: Liu, Rong-Peng, et al.
Published: (2024)

Approximations of Rockafellians, Lagrangians, and Dual Functions
by: Deride, Julio, et al.
Published: (2024)

Hidden Convexity in Active Learning: A Convexified Online Input Design for ARX Systems
by: Chatzikiriakos, Nicolas, et al.
Published: (2025)

Beyond Convexity: Proximal-Perturbed Lagrangian Methods for Efficient Functional Constrained Optimization
by: Moon, Sang Bin, et al.
Published: (2024)

Damped Proximal Augmented Lagrangian Method for weakly-Convex Problems with Convex Constraints
by: Dahal, Hari, et al.
Published: (2023)

Any-Dimensional Polynomial Optimization via de Finetti Theorems
by: Levin, Eitan, et al.
Published: (2025)

Revisiting Strong Duality, Hidden Convexity, and Gradient Dominance in the Linear Quadratic Regulator
by: Watanabe, Yuto, et al.
Published: (2025)

A Geometric Perspective on Polynomially Solvable Convex Maximization
by: Han, Shaoning, et al.
Published: (2026)

Successive Convexification with Feasibility Guarantee via Augmented Lagrangian for Non-Convex Optimal Control Problems
by: Oguri, Kenshiro
Published: (2023)

Relaxed Lagrangian Approach to First-Order Non-Convex Mean Field Type Control Problem
by: Mendico, Cristian, et al.
Published: (2024)

Efficient Algorithms for A Class of Stochastic Hidden Convex Optimization and Its Applications in Network Revenue Management
by: Chen, Xin, et al.
Published: (2022)

ripALM: A Relative-Type Inexact Proximal Augmented Lagrangian Method for Linearly Constrained Convex Optimization
by: Zhu, Jiayi, et al.
Published: (2024)

Regularization in Data-driven Predictive Control: A Convex Relaxation Perspective
by: Shang, Xu, et al.
Published: (2025)

Cooling Under Convexity: An Inventory Control Perspective on Industrial Refrigeration
by: Shah, Vade, et al.
Published: (2025)

A Nesterov-Accelerated Primal-Dual Splitting Algorithm for Convex Nonsmooth Optimization
by: Condat, Laurent, et al.
Published: (2026)

Exponential Stability of Primal-Dual Gradient Dynamics with Non-Strong Convexity
by: Chen, Xin, et al.
Published: (2019)

Interwoven SDP in Primal-Dual Proximal Splitting Methods for Adjustable Robust Convex Optimisation with SOS-Convex Polynomial Constraints
by: Dizon, Neil D., et al.
Published: (2026)

Dual Lagrangian Learning for Conic Optimization
by: Tanneau, Mathieu, et al.
Published: (2024)

Revisit First-order Methods for Geodesically Convex Optimization
by: Shu, Yunlu, et al.
Published: (2025)

Two-stage and Lagrangian Dual Decision Rules for Multistage Adaptive Robust Optimization
by: Daryalal, Maryam, et al.
Published: (2023)

Weak Optimal Transport: When is the Dual Potential Convex?
by: Pramenković, Filip
Published: (2025)

Dual Averaging With Non-Strongly-Convex Prox-Functions: New Analysis and Algorithm
by: Zhao, Renbo
Published: (2025)

Optimizing Representation in Redistricting: Dual Bounds for Partitioning Problems with Non-Convex Objectives
by: Fravel, Jamie, et al.
Published: (2023)

Accuracy Certificates for Convex Optimization at Accelerated Rates via Primal-Dual Averaging
by: Burns, Matthew X., et al.
Published: (2026)

An Augmented Lagrangian Primal-Dual Semismooth Newton Method for Multi-Block Composite Optimization
by: Deng, Zhanwang, et al.
Published: (2023)

Theoretical Perspectives on Jabr-Type Convex Relaxations for AC Optimal Power Flow
by: Riccardi, Gabor, et al.
Published: (2026)

A Proximal Augmented Lagrangian Method Based on Quadratic Approximations for Weakly Convex Optimization
by: Zhang, Yule, et al.
Published: (2026)

Optimal Regularization for a Data Source
by: Leong, Oscar, et al.
Published: (2022)

Smoothing Binary Optimization: A Primal-Dual Perspective
by: Liu, Wenbo, et al.
Published: (2025)

A Convexification-based Outer-Approximation Method for Convex and Nonconvex MINLP
by: Peng, Zedong, et al.
Published: (2024)

An Efficient Solution Method for Solving Convex Separable Quadratic Optimization Problems
by: Li, Shaoze, et al.
Published: (2025)

Optimal Primal-Dual Algorithm with Last iterate Convergence Guarantees for Stochastic Convex Optimization Problems
by: Boob, Digvijay, et al.
Published: (2024)