Saved in:
| Main Author: | Kitahara, Tomonari |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2507.04672 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Enhancing Top Efficiency by Minimizing Second-Best Scores: A Novel Perspective on Super Efficiency Models in DEA
by: Kitahara, Tomonari, et al.
Published: (2024)
by: Kitahara, Tomonari, et al.
Published: (2024)
A geometric simplex method in infinite-dimensional spaces
by: Smith, Robert L, et al.
Published: (2026)
by: Smith, Robert L, et al.
Published: (2026)
On the optimal pivot path of simplex method for linear programming based on reinforcement learning
by: Li, Anqi, et al.
Published: (2022)
by: Li, Anqi, et al.
Published: (2022)
On the facet pivot simplex method for linear programming II: a linear iteration bound
by: Yang, Yaguang
Published: (2022)
by: Yang, Yaguang
Published: (2022)
On the construction of a gradient method of quadratic optimization, optimal from the point of view of minimizing the distance to the exact solution
by: Pletnev, N. V.
Published: (2025)
by: Pletnev, N. V.
Published: (2025)
Pseudo basic steps: Bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming
by: Papageorgiou, Dimitri J., et al.
Published: (2025)
by: Papageorgiou, Dimitri J., et al.
Published: (2025)
On the facet pivot simplex method for linear programming
by: Yang, Yaguang
Published: (2021)
by: Yang, Yaguang
Published: (2021)
Numerical method for feasible and approximately optimal solutions of multi-marginal optimal transport beyond discrete measures
by: Neufeld, Ariel, et al.
Published: (2022)
by: Neufeld, Ariel, et al.
Published: (2022)
One-Dimensional Nonnegative Spline Smoothing via Convex Semi-Infinite Programming with a Cutting-Plane Method
by: Arai, Hiroki, et al.
Published: (2026)
by: Arai, Hiroki, et al.
Published: (2026)
Floorplanning with I/O assignment via feasibility-seeking and superiorization methods
by: Yu, Shan, et al.
Published: (2024)
by: Yu, Shan, et al.
Published: (2024)
Fast projection onto the intersection of simplex and singly linear constraint and its generalized Jacobian
by: Zhou, Weimi, et al.
Published: (2023)
by: Zhou, Weimi, et al.
Published: (2023)
On the feasibility of generalized inverse linear programs
by: Buchheim, Christoph, et al.
Published: (2025)
by: Buchheim, Christoph, et al.
Published: (2025)
Proximal gradient-type method with generalized distance and convergence analysis without global descent lemma
by: Yagishita, Shotaro, et al.
Published: (2025)
by: Yagishita, Shotaro, et al.
Published: (2025)
Taxicab distance based best-worst method for multi-criteria decision-making: An analytical approach
by: Ratandhara, Harshit, et al.
Published: (2024)
by: Ratandhara, Harshit, et al.
Published: (2024)
Bounds for the tracking error of first-order online optimization methods
by: Madden, Liam, et al.
Published: (2020)
by: Madden, Liam, et al.
Published: (2020)
Recursive feasibility for stochastic MPC and the rationale behind fixing flat tires
by: Fiacchini, Mirko, et al.
Published: (2025)
by: Fiacchini, Mirko, et al.
Published: (2025)
Measured-state conditioned recursive feasibility for stochastic model predictive control
by: Fiacchini, Mirko, et al.
Published: (2024)
by: Fiacchini, Mirko, et al.
Published: (2024)
Managing power balance and reserve feasibility in the AC unit commitment problem
by: Parker, Robert, et al.
Published: (2024)
by: Parker, Robert, et al.
Published: (2024)
Relationships between full-space and subspace quadratic interpolation models and simplex derivatives
by: Chen, Yiwen
Published: (2026)
by: Chen, Yiwen
Published: (2026)
Recovering feasibility in real-time conflict-free vehicle routing
by: Adamo, Tommaso, et al.
Published: (2022)
by: Adamo, Tommaso, et al.
Published: (2022)
An enhanced POSTA based on Nelder-Mead simplex search and quadratic interpolation
by: Liu, Tianyu
Published: (2024)
by: Liu, Tianyu
Published: (2024)
Convex Estimation of Sparse-Smooth Power Spectral Densities from Mixtures of Realizations with Application to Weather Radar
by: Kuroda, Hiroki, et al.
Published: (2023)
by: Kuroda, Hiroki, et al.
Published: (2023)
A two-step inertial method with a new step-size rule for variational inequalities in hilbert spaces
by: Peng, Jian-Wen, et al.
Published: (2026)
by: Peng, Jian-Wen, et al.
Published: (2026)
MPC for Tracking applied to rendezvous with non-cooperative tumbling targets ensuring stability and feasibility
by: Rebollo, Jose Antonio, et al.
Published: (2024)
by: Rebollo, Jose Antonio, et al.
Published: (2024)
Distributed solution methods for MPC based energy management method of interconnected microgrids: Dual ascent vs ADMM
by: Pham, Viet Hoang, et al.
Published: (2024)
by: Pham, Viet Hoang, et al.
Published: (2024)
Optimized and kinematically feasible multi-agent motion planning
by: Hellander, Anja, et al.
Published: (2026)
by: Hellander, Anja, et al.
Published: (2026)
Clustering sequence data with mixture Markov chains with covariates using multiple simplex constrained optimization routine (MSiCOR)
by: Das, Priyam, et al.
Published: (2016)
by: Das, Priyam, et al.
Published: (2016)
The number of global solutions for GPS source localization in two-dimension
by: Kwon, Kiwoon
Published: (2024)
by: Kwon, Kiwoon
Published: (2024)
Recursive stochastic differential games with non-Lipschitzian generators and viscosity solutions of Hamilton-Jacobi-Bellman-Isaacs equation
by: Wang, Guangchen, et al.
Published: (2024)
by: Wang, Guangchen, et al.
Published: (2024)
A Benders and column generation method to the integrated airline schedule and aircraft recovery with gate reassignment
by: Jiang, Jianlin, et al.
Published: (2025)
by: Jiang, Jianlin, et al.
Published: (2025)
Inherently robust suboptimal MPC for autonomous racing with anytime feasible SQP
by: Numerow, Logan, et al.
Published: (2024)
by: Numerow, Logan, et al.
Published: (2024)
Obtaining properly Pareto optimal solutions of multiobjective optimization problems via the branch and bound method
by: Wu, Weitian, et al.
Published: (2024)
by: Wu, Weitian, et al.
Published: (2024)
An SVD-like Decomposition of Bounded-Input Bounded-Output Functions
by: Brown, Brian Charles, et al.
Published: (2024)
by: Brown, Brian Charles, et al.
Published: (2024)
Multiple objective linear programming over the probability simplex
by: Mifrani, Anas
Published: (2024)
by: Mifrani, Anas
Published: (2024)
A fast approximate column-and-constraint generation method for two-stage robust mixed-integer programs
by: Goerigk, Marc, et al.
Published: (2025)
by: Goerigk, Marc, et al.
Published: (2025)
On the computation of the infinity Wasserstein distance and the Wasserstein Projection Problem
by: Auricchio, Gennaro, et al.
Published: (2025)
by: Auricchio, Gennaro, et al.
Published: (2025)
A computational comparison of handling distance constraints in MINLP
by: Hojny, Christopher, et al.
Published: (2026)
by: Hojny, Christopher, et al.
Published: (2026)
A hierarchy of convex relaxations for the total variation distance
by: Lasserre, Jean-Bernard
Published: (2024)
by: Lasserre, Jean-Bernard
Published: (2024)
An acceleration technique for methods for finding the nearest point in a polytope and computing the distance between two polytopes
by: Dolgopolik, M. V.
Published: (2022)
by: Dolgopolik, M. V.
Published: (2022)
On encoded quantum gate generation by iterative Lyapunov-based methods
by: da Silva, Paulo Sergio Pereira, et al.
Published: (2024)
by: da Silva, Paulo Sergio Pereira, et al.
Published: (2024)
Similar Items
-
Enhancing Top Efficiency by Minimizing Second-Best Scores: A Novel Perspective on Super Efficiency Models in DEA
by: Kitahara, Tomonari, et al.
Published: (2024) -
A geometric simplex method in infinite-dimensional spaces
by: Smith, Robert L, et al.
Published: (2026) -
On the optimal pivot path of simplex method for linear programming based on reinforcement learning
by: Li, Anqi, et al.
Published: (2022) -
On the facet pivot simplex method for linear programming II: a linear iteration bound
by: Yang, Yaguang
Published: (2022) -
On the construction of a gradient method of quadratic optimization, optimal from the point of view of minimizing the distance to the exact solution
by: Pletnev, N. V.
Published: (2025)