Cover Image

Convexoid: A Minimal Theory of Conjugate Convexity

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Wei, Ningji
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control 90C25
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

GFORS: GPU-Accelerated First-Order Method with Randomized Sampling for Binary Integer Programs
by: Wei, Ningji, et al.
Published: (2025)

A Gauge Set Framework for Flexible Robustness Design
by: Wei, Ningji, et al.
Published: (2025)

Convex quartic problems: homogenized gradient method and preconditioning
by: Dragomir, Radu-Alexandru, et al.
Published: (2023)

A Projection-Free Method for Solving Convex Bilevel Optimization Problems
by: Giang-Tran, Khanh-Hung, et al.
Published: (2023)

Convergence, Duality and Well-Posedness in Convex Bilevel Optimization
by: Giang-Tran, Khanh-Hung, et al.
Published: (2025)

Linear Convergence and Error Bounds for Optimization Without Strong Convexity
by: van Treek, Kira, et al.
Published: (2025)

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

Two Proofs of a Structural Theorem of Decreasing Minimization on Integrally Convex Sets
by: Murota, Kazuo, et al.
Published: (2025)

Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
by: Chen, Kaihuang, et al.
Published: (2025)

Lagrange Multipliers, Duality, and Sensitivity in Set-Valued Convex Programming via Pointed Closed Convex Processes
by: García-Castaño, Fernando, et al.
Published: (2024)

Faster Parametric Submodular Function Minimization by Exploiting Duality
by: Gupta, Swati, et al.
Published: (2026)

Faster Accelerated First-order Methods for Convex Optimization with Strongly Convex Function Constraints
by: Lin, Zhenwei, et al.
Published: (2022)

A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
by: Dörfler, Daniel, et al.
Published: (2020)

Gauges and Accelerated Optimization over Smooth and/or Strongly Convex Sets
by: Liu, Ning, et al.
Published: (2023)

Extending Exact Convex Relaxations of Quadratically Constrained Quadratic Programs
by: Kojima, Masakazu, et al.
Published: (2025)

A Set-Valued Lagrange Theorem based on a Process for Convex Vector Programming
by: García-Castaño, Fernando, et al.
Published: (2024)

A feasible smoothing accelerated projected gradient method for nonsmooth convex optimization
by: Nishioka, Akatsuki, et al.
Published: (2023)

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

Further Development in Convex Conic Reformulation of Geometric Nonconvex Conic Optimization Problems
by: Arima, Naohiko, et al.
Published: (2023)

Generalized Optimistic Methods for Convex-Concave Saddle Point Problems
by: Jiang, Ruichen, et al.
Published: (2022)

Preconditioned Proximal Gradient Methods with Conjugate Momentum: A Subspace Perspective
by: Chen, Jian, et al.
Published: (2026)

Performance Estimation for Smooth and Strongly Convex Sets
by: Luner, Alan, et al.
Published: (2024)

A Solution Concept for Convex Vector Optimization Problems based on a User-defined Region of Interest
by: Dörfler, Daniel, et al.
Published: (2026)

Exact Convex Reformulations of Linear Neural Networks via Completely Positive Lifting
by: Prakhya, Karthik, et al.
Published: (2026)

A Random Active Set Method for Strictly Convex Quadratic Problem with Simple Bounds
by: Gu, Ran, et al.
Published: (2021)

Low Rank Convex Clustering For Matrix-Valued Observations
by: Lin, Meixia, et al.
Published: (2024)

A high-order augmented Lagrangian method with arbitrarily fast convergence
by: Lee, Young-Ju, et al.
Published: (2026)

A polynomial time infeasible interior-point arc-search algorithm for convex optimization
by: Yang, Yaguang
Published: (2022)

Triangle Steepest Descent: A Geometry-Based Gradient Algorithm with Guaranteed R-Linear Convergence
by: Shen, Ya, et al.
Published: (2025)

Simplex Frank-Wolfe: Linear Convergence and Its Numerical Efficiency for Convex Optimization over Polytopes
by: Wang, Haoning, et al.
Published: (2025)

Stochastic Block Bregman Projection with Polyak-like Stepsize for Possibly Inconsistent Convex Feasibility Problems
by: Zhang, Lu, et al.
Published: (2026)

NewVEM: A Newton Vertex Exchange Method for a Class of Constrained Self-Concordant Minimization Problems
by: Liang, Ling, et al.
Published: (2024)

A symmetric primal-dual algorithmic framework for saddle point problems
by: He, Hongjin, et al.
Published: (2022)

A Level Set Method with Secant Iterations for the Least-Squares Constrained Nuclear Norm Minimization
by: Ma, Chiyu, et al.
Published: (2026)

Dynamic FISTA for Convex Composite Bi-Level Optimization
by: Merchav, Roey, et al.
Published: (2024)

Fast convergence of Frank-Wolfe algorithms on polytopes
by: Wirth, Elias, et al.
Published: (2024)

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)

Distributionally Robust Optimization over Wasserstein Balls with i.i.d. Structure
by: Kharitenko, Andrey, et al.
Published: (2025)

An adaptive ADMM with regularized spectral penalty for sparse portfolio selection
by: Xu, Xin
Published: (2025)