Imagen de Portada

Concave tents: a new tool for constructing concave reformulations of a large class of nonconvex optimization problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Gabl, Markus
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Finding quadratic underestimators for optimal value functions of nonconvex all-quadratic problems via copositive optimization
por: Gabl, Markus, et al.
Publicado: (2024)

New reformulations for 0-1 quadratic programming problem using quadratic nonconvex reformulation techniques and valid inequalities
por: Lu, Cheng, et al.
Publicado: (2026)

First-order algorithms for robust optimization problems via convex-concave saddle-point Lagrangian reformulation
por: Postek, Krzysztof, et al.
Publicado: (2021)

An inertial ADMM for a class of nonconvex composite optimization with nonlinear coupling constraints
por: Hien, Le Thi Khanh, et al.
Publicado: (2022)

Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems
por: Zeng, Liaoyuan, et al.
Publicado: (2021)

Tractable reformulations of DRO problems over structured optimal transport ambiguity sets
por: Chaouach, Lotfi M., et al.
Publicado: (2025)

Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems
por: Prudente, L. F., et al.
Publicado: (2023)

An accelerated first-order regularized momentum descent ascent algorithm for stochastic nonconvex-concave minimax problems
por: Zhang, Huiling, et al.
Publicado: (2023)

The large-scale charging scheduling problem for fleet batteries: Lagrangian decomposition with time-block reformulations
por: Fotedar, Sunney, et al.
Publicado: (2025)

A class of nonconvex semidefinite programming in which every KKT point is globally optimal
por: Nishioka, Akatsuki, et al.
Publicado: (2025)

Active-set Newton-MR methods for nonconvex optimization problems with bound constraints
por: Birgin, Ernesto G., et al.
Publicado: (2025)

Certifying optimality in nonconvex robust PCA
por: Gong, Pinxi, et al.
Publicado: (2026)

Universal nonmonotone line search method for nonconvex multiobjective optimization problems with convex constraints
por: Pinheiro, Maria Eduarda, et al.
Publicado: (2024)

On second-order weak sharp minima of general nonconvex set-constrained optimization problems
por: Ma, Xiaoxiao, et al.
Publicado: (2025)

An equivalent reformulation and multi-proximity gradient algorithms for a class of nonsmooth fractional programming
por: Zhou, Junpeng, et al.
Publicado: (2023)

Global convergence of a modified BFGS-type method based on function information for nonconvex multiobjective optimization problems
por: Yang, Yingxue
Publicado: (2024)

Adaptive directional decomposition methods for nonconvex constrained optimization
por: Shi, Qiankun, et al.
Publicado: (2025)

A new polynomially solvable class of quadratic optimization problems with box constraints
por: Hladík, Milan, et al.
Publicado: (2019)

High-probability complexity guarantees for nonconvex minimax problems
por: Laguel, Yassine, et al.
Publicado: (2024)

Simple linesearch-free first-order methods for nonconvex optimization
por: Yagishita, Shotaro, et al.
Publicado: (2025)

Stochastic ADMM with batch size adaptation for nonconvex nonsmooth optimization
por: Jin, Jiachen, et al.
Publicado: (2025)

A second-order cone representable class of nonconvex quadratic programs
por: Dey, Santanu S., et al.
Publicado: (2025)

Bilevel linear optimization belongs to NP and admits polynomial-size KKT-based reformulations
por: Buchheim, Christoph
Publicado: (2023)

Convex NMPC reformulations for a special class of nonlinear multi-input systems with application to rank-one bilinear networks
por: Klädtke, Manuel, et al.
Publicado: (2023)

A deterministic optimization algorithm for nonconvex and combinatorial bi-objective programming
por: Lee, Ye Seol, et al.
Publicado: (2024)

Distributed nonconvex optimization for control of water networks with time-coupling constraints
por: Jenks, Bradley, et al.
Publicado: (2023)

General framework for online-to-nonconvex conversion: Schedule-free SGD is also effective for nonconvex optimization
por: Ahn, Kwangjun, et al.
Publicado: (2024)

An inexact $q$-order regularized proximal Newton method for nonconvex composite optimization
por: Liu, Ruyu, et al.
Publicado: (2023)

Projected gradient methods for nonconvex and stochastic smooth optimization: new complexities and auto-conditioned stepsizes
por: Lan, Guanghui, et al.
Publicado: (2024)

Pseudo-concave optimization of the first eigenvalue of elliptic operators with application to topology optimization by homogenization
por: Nishioka, Akatsuki
Publicado: (2025)

Extended alternating structure-adapted proximal gradient algorithm for nonconvex nonsmooth problems
por: Gao, Ying, et al.
Publicado: (2024)

An implementable proximal-type method for computing critical points to minimization problems with a nonsmooth and nonconvex constraint
por: Sempere, Gregorio M., et al.
Publicado: (2024)

PolyFormer: learning efficient reformulations for scalable optimization under complex physical constraints
por: Wen, Yilin, et al.
Publicado: (2026)

An effective subgradient algorithm via Mifflin's line search for nonsmooth nonconvex multiobjective optimization
por: Maleknia, Morteza, et al.
Publicado: (2024)

Convergence rates for an inexact linearized ADMM for nonsmooth nonconvex optimization with nonlinear equality constraints
por: Bourkhissi, Lahcen El, et al.
Publicado: (2025)

Variable Bregman Majorization-Minimization algorithms for nonconvex nonsmooth optimization, with application to Poisson imaging
por: Adly, Maxence, et al.
Publicado: (2026)

Optimal and parameter-free gradient minimization methods for convex and nonconvex optimization
por: Lan, Guanghui, et al.
Publicado: (2023)

Second order optimality conditions in a new Lagrangian formulation for optimal control problems
por: Konopik, Michael, et al.
Publicado: (2025)

Avoiding strict saddle points of nonconvex regularized problems
por: Bai, Luwei, et al.
Publicado: (2024)

Newton and interior-point methods for (constrained) nonconvex-nonconcave minmax optimization with stability and instability guarantees
por: Chinchilla, Raphael, et al.
Publicado: (2022)