Cover Image

Bilateral facial reduction: qualification-free subdifferential calculus and exact duality

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Scott, Matthew S.
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control Functional Analysis 68Q25, 49J53, 52A41, 90C25 G.1.6
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Stable Recovery of Regularized Linear Inverse Problems
by: Nghia, Tran T. A., et al.
Published: (2024)

Improved global performance guarantees of second-order methods in convex minimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

On Global and Local Convergence of Iterative Linear Quadratic Optimization Algorithms for Discrete Time Nonlinear Control
by: Roulet, Vincent, et al.
Published: (2022)

Minimization Over the Nonconvex Sparsity Constraint Using A Hybrid First-order method
by: Yang, Xiangyu, et al.
Published: (2021)

Isolated Calmness in Regularized Convex Optimization
by: Nghia, Tran T. A., et al.
Published: (2026)

Geometric characterizations of Lipschitz stability for convex optimization problems
by: Nghia, Tran T. A.
Published: (2024)

Lipschitz stability of least-squares problems regularized by functions with $\mathcal{C}^2$-cone reducible conjugates
by: Cui, Ying, et al.
Published: (2024)

Bregman Finito/MISO for nonconvex regularized finite sum minimization without Lipschitz gradient continuity
by: Latafat, Puya, et al.
Published: (2021)

Douglas-Rachford splitting and ADMM for nonconvex optimization: Accelerated and Newton-type linesearch algorithms
by: Themelis, Andreas, et al.
Published: (2020)

Approximate optimality conditions and sensitivity analysis in nearly convex optimization
by: Van Tuyen, Nguyen, et al.
Published: (2024)

A Bregman forward-backward linesearch algorithm for nonconvex composite optimization: superlinear convergence to nonisolated local minima
by: Ahookhosh, Masoud, et al.
Published: (2019)

Projected subgradient methods for paraconvex optimization: Application to robust low-rank matrix recovery
by: Rahimi, Morteza, et al.
Published: (2024)

(Adaptive) Scaled gradient methods beyond locally Holder smoothness: Lyapunov analysis, convergence rate and complexity
by: Ghaderi, Susan, et al.
Published: (2025)

Block-coordinate and incremental aggregated proximal gradient methods for nonsmooth nonconvex problems
by: Latafat, Puya, et al.
Published: (2019)

Solving Regularized Multifacility Location Problems with Unknown Number of Centers via Difference-of-Convex Optimization
by: Geremew, W., et al.
Published: (2026)

Optimal Control of Several Motion Models
by: Cao, Tan H., et al.
Published: (2022)

Subgradient Methods on Manifolds with Lower Bounded Curvature
by: Bento, G. C., et al.
Published: (2026)

SPIRAL: A superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization
by: Behmandpoor, Pourya, et al.
Published: (2022)

Bregman level proximal subdifferentials and new characterizations of Bregman proximal operators
by: Wang, Ziyuan, et al.
Published: (2025)

Level proximal subdifferential, variational convexity, and pointwise quadratic approximation
by: Luo, Honglin, et al.
Published: (2024)

Galerkin-like Method for Integro-Differential Inclusions with applications to Volterra Sweeping processes
by: Pérez-Aros, Pedro, et al.
Published: (2023)

On Characterizations of $σ$-Quasiconvexity
by: Bao, Nguyen Xuan Duy, et al.
Published: (2025)

Explicit data-dependent characterizations of the subdifferential of convex pointwise suprema and optimality conditions
by: Caro, Stephanie, et al.
Published: (2026)

Approximate directional stationarity and associated qualification conditions
by: Käming, Isabella, et al.
Published: (2026)

A template for gradient norm minimization
by: Florea, Mihai I.
Published: (2024)

An optimal lower bound for smooth convex functions
by: Florea, Mihai I., et al.
Published: (2024)

Adaptive first-order methods with enhanced worst-case rates
by: Florea, Mihai I.
Published: (2024)

Optimal Methods for Unknown Piecewise Smooth Problems I: Convex Optimization
by: Lin, Zhenwei, et al.
Published: (2026)

A Symplectic Discretization Based Proximal Point Algorithm for Convex Minimization
by: Yuan, Ya-xiang, et al.
Published: (2024)

Generalized outer linearizations and extremal properties of rotational epi-symmetrizations
by: Hoehner, Steven, et al.
Published: (2026)

Reinterpreting EMML as Mirror Descent for Constrained Maximum Likelihood Estimation
by: Clerc, Antonin, et al.
Published: (2026)

ItsOPT: An inexact two-level smoothing framework for nonconvex optimization via high-order Moreau envelope
by: Kabgani, Alireza, et al.
Published: (2024)

ItsDEAL: Inexact two-level smoothing descent algorithms for weakly convex optimization
by: Kabgani, Alireza, et al.
Published: (2025)

Variational properties of the abstract subdifferential operator
by: Millàn, Reinier Diàz, et al.
Published: (2022)

Barrier Algorithms for Constrained Non-Convex Optimization
by: Dvurechensky, Pavel, et al.
Published: (2024)

Local Nonconvexity Indices for \(C^{1,1}\) Functions via Generalized Hessians
by: Palaisti, Marina
Published: (2026)

The Hard-Constraint PINNs for Interface Optimal Control Problems
by: Lai, Ming-Chih, et al.
Published: (2023)

Structure Preserving Approximation of Semiconcave Functions
by: Kunisch, Karl, et al.
Published: (2026)

Iterative Linear Quadratic Optimization for Nonlinear Control: Differentiable Programming Algorithmic Templates
by: Roulet, Vincent, et al.
Published: (2022)

Convex regularization and subdifferential calculus
by: Correa, Rafael, et al.
Published: (2024)