Cover Image

Exponential Conic Relaxations for Signomial Geometric Programming

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Filabadi, Milad Dehghani, Chen, Chen
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

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

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

Exponential Conic Optimization for Multi-Regime Service System Design under Congestion and Tail-Risk Control
by: Blanco, Víctor, et al.
Published: (2026)

Separable QCQPs and Their Exact SDP Relaxations
by: Kojima, Masakazu, et al.
Published: (2026)

A Low-rank Augmented Lagrangian Method for Polyhedral-SDP and Moment-SOS Relaxations of Polynomial Optimization
by: Hou, Di, et al.
Published: (2025)

Constructing QCQP Instances Equivalent to Their SDP Relaxations
by: Kojima, Masakazu, et al.
Published: (2025)

Non-Attainment of Minima in Non-Polyhedral Conic Optimization: A Robust SOCP Example
by: Nguyen, Vinh
Published: (2025)

Local and Global Convergence of Greedy Parabolic Target-Following Methods for Linear Programming
by: Nesterov, Yurii
Published: (2024)

Weighted Geometric Mean, Minimum Mediated Set, and Optimal Simple Second-Order Cone Representation
by: Wang, Jie
Published: (2022)

Dual Spectral Projected Gradient Method for Generalized Log-det Semidefinite Programming
by: Namchaisiri, Charles, et al.
Published: (2024)

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

Exactness and Effective Degree Bound of Lasserre's Relaxation for Polynomial Optimization over Finite Variety
by: Hua, Zheng, et al.
Published: (2021)

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

A conditional gradient homotopy method with applications to Semidefinite Programming
by: Dvurechensky, Pavel, et al.
Published: (2022)

Tight Semidefinite Relaxations for Verifying Robustness of Neural Networks
by: Azuma, Godai, et al.
Published: (2025)

On the Relationships among GPU-Accelerated First-Order Methods for Solving Linear Programming
by: Chen, Kaihuang, 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)

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)

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

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

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

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

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

New complexity bounds for primal--dual interior-point algorithms in conic optimization
by: Dahl, Joachim, et al.
Published: (2025)

Convexoid: A Minimal Theory of Conjugate Convexity
by: Wei, Ningji
Published: (2024)

An algorithm for minimum cardinality generators of cones
by: Mayer, Matthias Georg, et al.
Published: (2024)

The Power of Extrapolation in Federated Learning
by: Li, Hanmin, et al.
Published: (2024)

On Convergence and Stability of Two Extended BB-like Step Sizes
by: Xu, Xin
Published: (2025)

Stabilized Proximal Point Method via Trust Region Control
by: Li, Hanmin, et al.
Published: (2026)

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

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)

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

Strong Convergence of Relaxed Inertial Inexact Progressive Hedging Algorithm for Multi-stage Stochastic Variational Inequality Problems
by: Chen, Jiaxin, et al.
Published: (2024)

Multiobjective Programming and Weighting Scalar Problem
by: Ivanov, Vsevolod I.
Published: (2025)

Kurdyka-Łojasiewicz exponent via Hadamard parametrization
by: Ouyang, Wenqing, et al.
Published: (2024)

Universal Complexity Bounds for Universal Gradient Methods in Nonlinear Optimization
by: Nesterov, Yurii
Published: (2025)

Kurdyka-Łojasiewicz exponent via square transformation
by: Ouyang, Wenqing
Published: (2025)

Halpern Acceleration of the Inexact Proximal Point Method of Rockafellar
by: Zhang, Liwei, et al.
Published: (2025)