Cover Image

Optimization over convex polyhedra via Hadamard parametrizations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Tang, Tianyun, Toh, Kim-Chuan
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control 90C26, 90C30, 90C46
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

A preconditioned augmented Lagrangian method for solving semidefinite programming problems
by: Tang, Tianyun, et al.
Published: (2026)

A low-rank augmented Lagrangian method for doubly nonnegative relaxations of mixed-binary quadratic programs
by: Hou, Di, et al.
Published: (2025)

Benign landscapes of low-dimensional relaxations for orthogonal synchronization on general graphs
by: McRae, Andrew D., et al.
Published: (2023)

A minimal face constant rank constraint qualification for reducible conic programming
by: Andreani, Roberto, et al.
Published: (2023)

On solving a rank regularized minimization problem via equivalent factorized column-sparse regularized models
by: Li, Wenjing, et al.
Published: (2023)

Projection-based curve pattern search for black-box optimization over smooth convex sets
by: Jia, Xiaoxi, et al.
Published: (2025)

ZOBA: An Efficient Single-loop Zeroth-order Bilevel Optimization Algorithm
by: Rando, Marco, et al.
Published: (2026)

Penalty decomposition derivative free method for the minimization of partially separable functions over a convex feasible set
by: Cecere, Francesco, et al.
Published: (2025)

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

A sensitivity-based method for bilevel optimization problems: Theoretical analysis and computational performance
by: Nolasco, Eduardo, et al.
Published: (2025)

Nesterov's accelerated gradient for unbounded convex functions finds the minimum-norm point in the dual space
by: Sakabe, Keiya
Published: (2026)

Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
by: Tang, Tianyun, et al.
Published: (2024)

Sublinear Scalarizations for Proper and Approximate Proper Efficient Points in Nonconvex Vector Optimization
by: García-Castaño, Fernando, et al.
Published: (2024)

A modified exact penalty approach for general constrained $\ell_0$-sparse optimization problems
by: Kanzow, Christian, et al.
Published: (2025)

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

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

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
by: Ghaffari-Hadigheh, Alireza, et al.
Published: (2022)

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

A Bregman ADMM for Bethe variational problem
by: Khoo, Yuehaw, et al.
Published: (2025)

Optimality conditions for problems over symmetric cones and a simple augmented Lagrangian method
by: Lourenço, Bruno F., et al.
Published: (2017)

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

On Constraint Qualifications for MPECs with Applications to Bilevel Hyperparameter Optimization for Machine Learning
by: Li, Jiani, et al.
Published: (2025)

Closing the duality gap of the generalized trace ratio problem
by: Yang, Meijia, et al.
Published: (2024)

A Surrogate Value Function Formulation for Bilevel Optimization
by: Xu, Mengwei, et al.
Published: (2025)

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

Derivative-Free Bilevel Optimization with Inexact Lower-Level Solutions
by: Cesaroni, Edoardo, et al.
Published: (2026)

Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
by: Lapucci, Matteo, et al.
Published: (2024)

Improving Convergence Guarantees of Random Subspace Second-order Algorithm for Nonconvex Optimization
by: Higuchi, Rei, et al.
Published: (2024)

On Tackling High-Dimensional Nonconvex Stochastic Optimization via Stochastic First-Order Methods with Non-smooth Proximal Terms and Variance Reduction
by: Xie, Yue, et al.
Published: (2025)

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

A nonsmooth Frank-Wolfe algorithm through a dual cutting-plane approach
by: Mazanti, Guilherme, et al.
Published: (2024)

Second-Order Necessary Conditions, Constraint Qualifications and Exact Penalty for Mathematical Programs with Switching Constraints
by: Chen, Jiawei, et al.
Published: (2024)

Duality-based single-level reformulations of bilevel optimization problems
by: Dempe, Stephan, et al.
Published: (2024)

Exact Solution Procedure for the Log-Linear Continuous Knapsack Problem
by: Lahiri, Somdeb
Published: (2024)

Second-order sequential optimality conditions for nonlinear semidefinite optimization problems
by: Li, Huimin, et al.
Published: (2025)

A second-order sequential optimality condition for nonlinear second-order cone programming problems
by: Fukuda, Ellen H., et al.
Published: (2023)

A Modified Proximal Bundle Method Under A Frank-Wolfe Perspective
by: Fersztand, David, et al.
Published: (2024)

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

Effective Front-Descent Algorithms with Convergence Guarantees
by: Lapucci, Matteo, et al.
Published: (2024)