:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Truffet, Laurent
Format:	Preprint
Published:	2026
Subjects:	Optimization and Control 90C05, 03D15
Online Access:	https://arxiv.org/abs/2604.06726
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Substitution for minimizing/maximizing a tropical linear (fractional) programming
by: Truffet, L.
Published: (2026)

Rescue Craft Allocation in Tidal Waters of the North and Baltic Sea
by: Mucke, Tom, et al.
Published: (2024)

Conditions when the problems of linear programming are algorithmically unsolvable
by: Chernov, Viktor, et al.
Published: (2023)

A Non-Archimedean Interior Point Method for Solving Lexicographic Multi-Objective Quadratic Programming Problems
by: Fiaschi, Lorenzo, et al.
Published: (2021)

A smoothing proximal gradient algorithm for matrix rank minimization problem
by: Yu, Quan, et al.
Published: (2021)

A Regression-Based Prediction-Correction Method for Stochastic Time-Varying Optimization Problems
by: Kamijima, Tomoya, et al.
Published: (2025)

A Newton Augmented Lagrangian Method for Symmetric Cone Programming with Complexity Analysis
by: Zhang, Rui-Jin, et al.
Published: (2025)

Structural and Solution Analysis for the Ordered Weber Problem under Spatial Uncertainty
by: Blanco, Víctor, et al.
Published: (2025)

Adjoint-based optimal control of jump-diffusion processes
by: Bartsch, Jan, et al.
Published: (2025)

On the Relationships among GPU-Accelerated First-Order Methods for Solving Linear Programming
by: Chen, Kaihuang, et al.
Published: (2025)

A Sequential Quadratic Programming Method for Optimization with Stochastic Objective Functions, Deterministic Inequality Constraints and Robust Subproblems
by: Qiu, Songqiang, et al.
Published: (2023)

High-precision linear minimization is no slower than projection
by: Woodstock, Zev
Published: (2025)

A Sparse Smoothing Newton Method for Solving Discrete Optimal Transport Problems
by: Hou, Di, et al.
Published: (2023)

Peaceman-Rachford Splitting Method Converges Ergodically for Solving Convex Optimization Problems
by: Chen, Kaihuang, et al.
Published: (2025)

Stochastic Approach for Price Optimization Problems with Decision-dependent Uncertainty
by: Hikima, Yuya, et al.
Published: (2023)

AS-BOX: Additional Sampling Method for Weighted Sum Problems with Box Constraints
by: Krejić, Nataša, et al.
Published: (2025)

Stochastic Block Bregman Projection with Polyak-like Stepsize for Possibly Inconsistent Convex Feasibility Problems
by: Zhang, Lu, et al.
Published: (2026)

Continuity in Parametric Linear Programming
by: Lahiri, Somdeb
Published: (2024)

Stiefel optimization is NP-hard
by: Lai, Zehua, et al.
Published: (2025)

Grassmannian optimization is NP-hard
by: Lai, Zehua, et al.
Published: (2024)

A simulation-optimization approach for fractional, profitability-oriented inventory control under service-level type constraints
by: Sun, Tianxiao, et al.
Published: (2026)

QPALM: A Proximal Augmented Lagrangian Method for Nonconvex Quadratic Programs
by: Hermans, Ben, et al.
Published: (2020)

Low-Rank Multi-Objective Linear Programming
by: Löhne, Andreas, et al.
Published: (2025)

Distributed Parallel Structure-Aware Presolving for Arrowhead Linear Programs
by: Kempke, Nils-Christian, et al.
Published: (2026)

Sample Average Approximation for Stochastic Programming with Equality Constraints
by: Lew, Thomas, et al.
Published: (2022)

Predict-then-Calibrate: A New Perspective of Robust Contextual LP
by: Sun, Chunlin, et al.
Published: (2023)

Randomized quasi-Monte Carlo methods for risk-averse stochastic optimization
by: Melnikov, Olena, et al.
Published: (2024)

Engagement Zones for a Turn Constrained Pursuer
by: Chapman, Thomas, et al.
Published: (2025)

Refined TSSOS
by: Shaydurova, Daria, et al.
Published: (2024)

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

Multi-objective stochastic linear programming with recourse and flexible decision making
by: Hamel, Andreas H., et al.
Published: (2024)

A Sequential Homotopy Method for Mathematical Programming Problems
by: Potschka, Andreas, et al.
Published: (2019)

A Single-Loop Stochastic Proximal Quasi-Newton Method for Large-Scale Nonsmooth Convex Optimization
by: Song, Yongcun, et al.
Published: (2024)

The Non-Substitution Theorem, Uniqueness of Solution and Convex combinations of basic optimal solutions for linear optimization
by: Lahiri, Somdeb
Published: (2024)

An investigation of stochastic trust-region based algorithms for finite-sum minimization
by: Bellavia, Stefania, et al.
Published: (2024)

Inexact Restoration via random models for unconstrained noisy optimization
by: Morini, Benedetta, et al.
Published: (2024)

Accelerating Column Generation in Highly Degenerate Integer Programming Problems with Template Pricing
by: Marshall, Luke, et al.
Published: (2026)

Application and issues in abstract convexity
by: Millán, Reinier Díaz, et al.
Published: (2022)

A Stochastic Implicit Proximal Point Algorithm for Solving Linearly Constrained Stochastic Minimax Problems
by: Zhu, Kehan, et al.
Published: (2026)

ASPEN: An Additional Sampling Penalty Method for Finite-Sum Optimization Problems with Nonlinear Equality Constraints
by: Krejić, Nataša, et al.
Published: (2025)