Image de couverture de livre

Fast projection onto the intersection of simplex and singly linear constraint and its generalized Jacobian

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Zhou, Weimi, Liu, Yong-Jin
Format:	Preprint
Publié:	2023
Sujets:	Optimization and Control
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

On Wasserstein Distributionally Robust Mean Semi-Absolute Deviation Portfolio Model: Robust Selection and Efficient Computation
par: Zhou, Weimi, et autres
Publié: (2024)

On the facet pivot simplex method for linear programming II: a linear iteration bound
par: Yang, Yaguang
Publié: (2022)

Fast projection onto the top-k-sum constraint
par: Pan, Jianting, et autres
Publié: (2025)

On the optimal pivot path of simplex method for linear programming based on reinforcement learning
par: Li, Anqi, et autres
Publié: (2022)

Fast Newton methods for linear-quadratic dynamic games with application to autonomous vehicle platooning and intersection crossing
par: Baghbadorani, Reza Rahimi, et autres
Publié: (2026)

Inner approximations of convex sets and intersections of projectionally exposed cones
par: Lourenço, Bruno F., et autres
Publié: (2025)

How to project onto SL($n$)
par: Jaap, Patrick, et autres
Publié: (2025)

Geometric stabilization of virtual linear nonholonomic constraints
par: Simoes, Alexandre Anahory, et autres
Publié: (2024)

On the controllability in projections for linear quantum systems
par: Chambrion, Thomas, et autres
Publié: (2024)

Second-order optimality conditions for optimization problems with generalized equation constraints
par: Benko, M., et autres
Publié: (2026)

A quadratically convergent semismooth Newton method for nonlinear semidefinite programming without generalized Jacobian regularity
par: Feng, Fuxiaoyue, et autres
Publié: (2024)

Sensitivity analysis for linear changes of the constraint matrix of a (mixed-integer) linear program
par: Derval, Guillaume, et autres
Publié: (2024)

On the facet pivot simplex method for linear programming
par: Yang, Yaguang
Publié: (2021)

A condensing approach for linear-quadratic optimization with geometric constraints
par: De Marchi, Alberto
Publié: (2025)

A geometric simplex method in infinite-dimensional spaces
par: Smith, Robert L, et autres
Publié: (2026)

Constructive reachability for linear control problems under conic constraints
par: Pouchol, Camille, et autres
Publié: (2024)

Complexity of linearized quadratic penalty for optimization with nonlinear equality constraints
par: Bourkhissi, Lahcen El, et autres
Publié: (2024)

Input-to-state stabilization of linear systems under data-rate constraints
par: Zamani, Mahmoud, et autres
Publié: (2026)

Representability of forests via generalized subtour elimination constraints
par: Ota, Matheus J.
Publié: (2025)

Multiple objective linear programming over the probability simplex
par: Mifrani, Anas
Publié: (2024)

Closed-loop analysis of linear stochastic MPC with risk-averse constraints
par: Schießl, Jonas, et autres
Publié: (2026)

Optimistic Noise-Aware Sequential Quadratic Programming for Equality Constrained Optimization with Rank-Deficient Jacobians
par: Berahas, Albert S., et autres
Publié: (2025)

Fast Projection onto the Capped Simplex with Applications to Sparse Regression in Bioinformatics
par: Ang, Andersen, et autres
Publié: (2021)

On the feasibility of generalized inverse linear programs
par: Buchheim, Christoph, et autres
Publié: (2025)

Mechanical feedback linearization of single-input mechanical control systems
par: Nowicki, Marcin, et autres
Publié: (2022)

A sparse ADMM-based solver for linear MPC subject to terminal quadratic constraint
par: Krupa, Pablo, et autres
Publié: (2021)

Complexity of a linearized augmented Lagrangian method for nonconvex minimization with nonlinear equality constraints
par: Bourkhissi, Lahcen El, et autres
Publié: (2023)

Convergence rates for an inexact linearized ADMM for nonsmooth nonconvex optimization with nonlinear equality constraints
par: Bourkhissi, Lahcen El, et autres
Publié: (2025)

On moment relaxations for linear state feedback controller synthesis with non-convex quadratic costs and constraints
par: Gramlich, Dennis, et autres
Publié: (2024)

Bounds for the number of basic feasible solutions generated by the simplex method with the largest distance rule
par: Kitahara, Tomonari
Publié: (2025)

Global optimization of quadratic root-difference minimization under elliptic annulus constraints
par: Yang, Meijia, et autres
Publié: (2026)

Solving a linear program via a single unconstrained minimization
par: Otemissov, Adilet, et autres
Publié: (2025)

Convergence analysis of linearized $\ell_q$ penalty methods for nonconvex optimization with nonlinear equality constraints
par: Bourkhissi, Lahcen El, et autres
Publié: (2025)

Carleman estimates for degenerate parabolic equations with single interior point degeneracy and its applications
par: Liu, Yuanhang, et autres
Publié: (2023)

A double-pivot degenerate-robust simplex algorithm for linear programming
par: Yang, Yaguang, et autres
Publié: (2021)

Efficient LP warmstarting for linear modifications of the constraint matrix
par: Derval, Guillaume, et autres
Publié: (2025)

Necessary conditions for turnpike property for generalized linear-quadratic problems
par: Guglielmi, Roberto, et autres
Publié: (2024)

An enhanced POSTA based on Nelder-Mead simplex search and quadratic interpolation
par: Liu, Tianyu
Publié: (2024)

Generalized open-loop Nash equilibria in linear-quadratic difference games with coupled-affine inequality constraints
par: Mohapatra, Partha Sarathi, et autres
Publié: (2023)

Automated algorithm design for convex optimization problems with linear equality constraints
par: Ozaslan, Ibrahim K., et autres
Publié: (2025)