Image de couverture de livre

On the solution set of semi-infinite tensor complementarity problem

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Deb, R., Das, A. K.
Format:	Preprint
Publié:	2023
Sujets:	Optimization and Control 90C30
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

An efficient penalty decomposition algorithm for minimization over sparse symmetric sets
par: Mousavi, Ahmad, et autres
Publié: (2026)

A Lasry-Lions envelope approach for mathematical programs with complementarity constraints
par: Wang, Jia, et autres
Publié: (2025)

An arc-search BFGS algorithm for unconstrained nonlinear optimization problems
par: Yang, Yaguang
Publié: (2026)

A linesearch-based derivative-free method for noisy black-box problems
par: De Santis, Alberto, et autres
Publié: (2025)

Optimality conditions for problems over symmetric cones and a simple augmented Lagrangian method
par: Lourenço, Bruno F., et autres
Publié: (2017)

A second-order sequential optimality condition for nonlinear second-order cone programming problems
par: Fukuda, Ellen H., et autres
Publié: (2023)

On some properties of set-valued tensor complementarity problem
par: Deb, R., et autres
Publié: (2023)

Projection-based curve pattern search for black-box optimization over smooth convex sets
par: Jia, Xiaoxi, et autres
Publié: (2025)

Duality-based single-level reformulations of bilevel optimization problems
par: Dempe, Stephan, et autres
Publié: (2024)

A class of matrix splitting-based fixed-point iteration method for the vertical nonlinear complementarity problem
par: Yapeng, Wang, et autres
Publié: (2025)

A preconditioned augmented Lagrangian method for solving semidefinite programming problems
par: Tang, Tianyun, et autres
Publié: (2026)

Second-order sequential optimality conditions for nonlinear semidefinite optimization problems
par: Li, Huimin, et autres
Publié: (2025)

Penalty decomposition derivative free method for the minimization of partially separable functions over a convex feasible set
par: Cecere, Francesco, et autres
Publié: (2025)

On convergence of a $q$-random coordinate constrained algorithm for non-convex problems
par: Ghaffari-Hadigheh, Alireza, et autres
Publié: (2022)

Non-SOS Positivstellensätze for semi-algebraic sets defined by polynomial matrix inequalities
par: Guo, Feng
Publié: (2025)

Extragradient method with feasible inexact projection to variational inequality problem
par: Millán, R. Díaz, et autres
Publié: (2023)

Existence of solutions for polyhedral convex set optimization problems
par: Löhne, Andreas
Publié: (2023)

A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization
par: Mansueto, Pierluigi
Publié: (2025)

Extending Linear Convergence of the Proximal Point Algorithm: The Quasar-Convex Case
par: de Brito, José, et autres
Publié: (2025)

A computationally efficient arc-search interior-point algorithm for nonlinear constrained optimization
par: Yang, Yaguang
Publié: (2024)

GFORS: GPU-Accelerated First-Order Method with Randomized Sampling for Binary Integer Programs
par: Wei, Ningji, et autres
Publié: (2025)

A Subspace Minimization Barzilai-Borwein Method for Multiobjective Optimization Problems
par: Chen, Jian, et autres
Publié: (2024)

Star Quasiconvexity: a Unified Approach for Linear Convergence of First-Order Methods Beyond Convexity
par: Khanh, Phan Quoc, et autres
Publié: (2025)

Lipschitz-free Projected Subgradient Method with Time-varying Step-size
par: Xia, Yong, et autres
Publié: (2024)

A four-operator splitting algorithm for nonconvex and nonsmooth optimization
par: Alcantara, Jan Harold, et autres
Publié: (2024)

Splitting Proximal Point Algorithms for the Sum of Prox-Convex Functions
par: de Brito, Jose, et autres
Publié: (2026)

On Complexity of Model-Based Derivative-Free Methods
par: Chaudhry, Abraar, et autres
Publié: (2025)

First-order Methods for Unconstrained Vector Optimization Problems: A Unified Majorization-Minimization Perspective
par: Chen, Jian, et autres
Publié: (2024)

A heavy-ball type curve search method for smooth convexly constrained optimization
par: Donnini, Federica, et autres
Publié: (2026)

Scaled Proximal Gradient Methods for Multiobjective Optimization: Improved Linear Convergence and Nesterov's Acceleration
par: Chen, Jian, et autres
Publié: (2024)

Characterizations of Strongly Quasiconvex Functions
par: Hadjisavvas, Nicolas, et autres
Publié: (2025)

Convergence Rate of Projected Subgradient Method with Time-varying Step-sizes
par: Zhu, Zhihan, et autres
Publié: (2024)

On the Worst-Case Analysis of Cyclic Block Coordinate Descent type Algorithms
par: Kamri, Yassine, et autres
Publié: (2025)

Numerical Design of Optimized First-Order Algorithms
par: Kamri, Yassine, et autres
Publié: (2025)

Iteration Complexity of Frank-Wolfe and Its Variants for Bilevel Optimization
par: Palmieri, Anthony, et autres
Publié: (2026)

Stochastic Approximation Proximal Subgradient Method for Stochastic Convex-Concave Minimax Optimization
par: Dai, Yu-Hong, et autres
Publié: (2024)

A Proximal Augmented Lagrangian Method Based on Quadratic Approximations for Weakly Convex Optimization
par: Zhang, Yule, et autres
Publié: (2026)

Operation of an ambulance fleet under uncertainty
par: Guigues, Vincent, et autres
Publié: (2022)

A Bregman ADMM for Bethe variational problem
par: Khoo, Yuehaw, et autres
Publié: (2025)

Properties of the complementarity set for the cone of copositive matrices
par: Kostyukova, O. I.
Publié: (2024)