Imagen de Portada

Outer Approximation Scheme for Weakly Convex Constrained Optimization Problems

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bednarczuk, Ewa M., Bruccola, Giovanni, Pesquet, Jean-Christophe, Rutkowski, Krzysztof
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control 90C20, 90C23, 90C26
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Forward-Backward algorithms for weakly convex problems
por: Bednarczuk, Ewa, et al.
Publicado: (2023)

A Moment-SOS Hierarchy for Robust Polynomial Matrix Inequality Optimization with SOS-Convexity
por: Guo, Feng, et al.
Publicado: (2023)

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

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

On the Convexity of the Solution Set of Linear Complementarity Problem over Tensor Spaces
por: Sharma, Sonali, et al.
Publicado: (2026)

Sparse Polynomial Matrix Optimization
por: Miller, Jared, et al.
Publicado: (2024)

Sparse Polynomial Optimization with Unbounded Sets
por: Huang, Lei, et al.
Publicado: (2024)

Extended Triangle Inequalities for Nonconvex Box-Constrained Quadratic Programming
por: Anstreicher, Kurt M., et al.
Publicado: (2025)

Exploiting Sign Symmetries in Minimizing Sums of Rational Functions
por: Guo, Feng, et al.
Publicado: (2024)

Nonconvergence of a sum-of-squares hierarchy for global polynomial optimization based on push-forward measures
por: Slot, Lucas, et al.
Publicado: (2024)

An extension of an RLT-based solver to MINLP polynomial problems
por: González-Díaz, Julio, et al.
Publicado: (2024)

Sum-of-squares hierarchies for polynomial optimization and the Christoffel-Darboux kernel
por: Slot, Lucas
Publicado: (2021)

Bound tightening in lifted formulations: (sub)solver-dependent impact on performance in RLT-based algorithms
por: González-Díaz, Julio, et al.
Publicado: (2025)

An Exceptionally Difficult Binary Quadratic Optimization Problem with Symmetry: a Challenge for The Largest Unsolved QAP Instance Tai256c
por: Fujii, Koichi, et al.
Publicado: (2023)

Parabolic Approximation & Relaxation for MINLP
por: Göß, Adrian, et al.
Publicado: (2024)

Norm-induced Cuts: Outer Approximation for Lipschitzian Constraint Functions
por: Göß, Adrian, et al.
Publicado: (2024)

A Bilevel Hierarchy of Strengthened Complex Moment Relaxations for Complex Polynomial Optimization
por: Wang, Jie
Publicado: (2024)

Global Solutions to Non-Convex Functional Constrained Problems with Hidden Convexity
por: Fatkhullin, Ilyas, et al.
Publicado: (2025)

Solving Sparse MIQCQPs: Application to the Unit Commitment Problem with ACOPF Constraints
por: Gómez-Casares, Ignacio, et al.
Publicado: (2025)

Convex quadratic sets and the complexity of mixed integer convex quadratic programming
por: Del Pia, Alberto
Publicado: (2023)

A Frank-Wolfe-based primal heuristic for quadratic mixed-integer optimization
por: Mexi, Gioni, et al.
Publicado: (2025)

On the convexity for the range set of two quadratic functions
por: Nguyen, Huu-Quang, et al.
Publicado: (2025)

Beyond binarity: Semidefinite programming for ternary quadratic problems
por: de Meijer, Frank, et al.
Publicado: (2026)

Clash of MINLP Relaxations: Piecewise Linear vs. Global Parabolic
por: Göß, Adrian
Publicado: (2026)

New results on the local-nonglobal minimizers of the generalized trust-region subproblem
por: Ai, Wenbao, et al.
Publicado: (2024)

Exact SDP relaxations for a class of quadratic programs with finite and infinite quadratic constraints
por: Arima, Naohiko, et al.
Publicado: (2024)

Hidden convexity of quadratic systems and its application to quadratic programming
por: Huy, Nguyen Quang, et al.
Publicado: (2026)

Globally Solving Concave Quadratic Programs via Doubly Nonnegative Relaxation
por: Qu, Zheng, et al.
Publicado: (2023)

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

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

Interval-Valued Optimization Problems for Strongly LU-E-Invex and Strongly LU-E-Preinvex Functions
por: Tauheed, et al.
Publicado: (2026)

Cardinality-Constrained Multi-Objective Optimization: Novel Optimality Conditions and Algorithms
por: Lapucci, Matteo, et al.
Publicado: (2023)

Efficient Separation of RLT Cuts for Implicit and Explicit Bilinear Terms
por: Bestuzheva, Ksenia, et al.
Publicado: (2022)

Relaxations of KKT Conditions do not Strengthen Finite RLT and SDP-RLT Bounds for Nonconvex Quadratic Programs
por: Yildirim, E. Alper
Publicado: (2025)

DC Semidefinite Programming and Cone Constrained DC Optimization: Theory and Local Search Methods
por: Dolgopolik, M. V.
Publicado: (2021)

Sparse convex relaxations in polynomial optimization
por: Averkov, Gennadiy, et al.
Publicado: (2024)

Lagrangian Reformulation for Nonconvex Optimization: Tailoring Problems to Specialized Solvers
por: Quintero, Rodolfo A., et al.
Publicado: (2024)

Optimality Conditions and Duality for Multiobjective Fractional Bilevel Optimization Problems
por: Lara, Felipe, et al.
Publicado: (2025)

Piecewise SOS-Convex Moment Optimization and Applications via Exact Semi-Definite Programs
por: Huang, Queenie Yingkun, et al.
Publicado: (2024)

A Moment-QSOS Hierarchy for a Class of Quaternion Polynomial Optimization Problems
por: Liu, Yanqing, et al.
Publicado: (2026)