Papers nuevos sobre Optimización
118 papers nuevos sobre optimización en los últimos 7 días, dentro de Matemática y estadística. Acá están los 50 que Pipette considera más valiosos, con el resultado principal en palabras de sus autores.
Lo mejor de la semana
Doubly exponential convergence of the cyclic steepest descent method for strictly convex quadratics in arbitrary dimensions
We prove the superlinear side of this threshold for the real algorithm in arbitrary dimensions, and in fact obtain a faster, doubly exponential, decay.
PreprintDice ser un gran avanceStochastic Appointment Scheduling with Patient-and-Time-Dependent Probability Distributions
We propose a stochastic programming model that captures exponentially many scenarios with polynomially many variables and constraints, without sampling.
PreprintUso en el mundo realBenign Nonconvex Landscape for Policy Optimization: Infinite-Horizon Discounted MDPs with General State and Action Spaces
To address this issue, we propose weaker conditions that guarantee the absence of suboptimal stationary points and establish the Polyak--Lojasiewicz--Kurdyka (PLK) condition for the policy gradient objective with a finite concentrability coefficient.
PreprintAn Exact Algorithm for the Max-Min Covering Location Blocker Problem
We develop an exact nested decomposition that exploits the max-min coverage structure at both levels.
PreprintUso en el mundo realA General Multicriteria Optimization Perspective on Resilience
Thus, resilience should be approached from an explicit multicriteria perspective rather than through a universal, preference-independent scalar index.
PreprintFrom Frequentist to Bayesian Contextual Optimization
We propose Bayesian contextual optimization (BCO), a framework that maintains a Gibbs posterior over the parameter space.
PreprintSWAP: A Scalable, Warm-Startable, Anytime Permutation Solver for Optimal Transport
We introduce SWAP, an iterative solver that operates directly in permutation space for equally weighted point clouds.
PreprintOptimal High-Order Methods for Solving Monotone Variational Inequalities
In this paper, we propose a novel second-order method that achieves the optimal rate of .
PreprintAnchored Extra-Proximal Methods: Optimal Higher-Order Methods for Monotone Inclusion Problems
For every , assuming that the th derivative of the single-valued operator is Lipschitz continuous, we combine this construction with a bisection line search to obtain a th-order method that finds a point with tangent residual at most in oracle calls.
PreprintThe logarithmic spiral is optimal for shoreline search: a computer-assisted proof
We give a computer-assisted proof.
PreprintThe Exponential Price of Determinism in Nonsmooth Nonconvex Optimization
We answer this question negatively by proving a lower bound of order for deterministic algorithm, closing the exponential gap between the previously known lower and upper bounds and resolving an open problem posed by Jordan et al. [2023].
PreprintStochastic Augmented Lagrangian Framework with Second-Order Convergence Guarantees for Nonconvex Expectation-Constrained Optimization
In this paper, we propose and analyze an augmented Lagrangian framework for solving stochastic nonconvex optimization problems with expectation-based equality constraints over a closed and convex constraint set.
PreprintOn the Minimum Number of Linear Pieces Required to Approximate Nonlinear Functions under an Accuracy Constraint
We provide new best upper bounds for the classical instance set in R2 and we derive the first lower bounds for these instances, closing more than a third of the instances from the literature.
PreprintConvergence of Rotation-based Matrix Optimizers: A Unified Analysis of SOAP, Conda, and SPlus
As our main result, we establish, for the first time, the convergence rate of SOAP with sharp dimensional dependence, as well as the convergence rate of Adam measured by the nuclear norm.
PreprintBeyond Shadow Weights: Quantization-Aware Training as Quantized-Endpoint Descent
In this paper, we offer a different explanation by treating QAT as finite-grid endpoint dynamics.
PreprintUso en el mundo realOptimal Fast Charging of All-Solid-State Batteries under Cathode Transport Constraints
For constant diffusivity, we prove existence of a global minimizer and show that every minimum-time policy is maximal-feasible: the charging rate remains at its upper bound until the transport constraint becomes active and subsequently follows the active boundary.
PreprintUso en el mundo realScalable Incremental Robustness Analysis of Neural Network Feedback Systems
This paper develops a unified and scalable framework for incremental robust stability and performance analysis of feedback interconnections involving high-dimensional NNs and unmodeled dynamics.
PreprintEnergy minimization for eight points on the sphere
For the logarithmic and Coulomb energies, we show that the unique global minimizer up to congruence is a square antiprism with height characterized by a unique stationarity equation.
PreprintCombinatorial Optimization Augmented Machine Learning for Dynamic Electric Autonomous Dial-a-Ride Problem
To solve this problem, we develop an ML--CO policy following the combinatorial optimization augmented machine learning (COAML) framework, which combines a statistical model with a combinatorial optimization layer for decision making.
PreprintUso en el mundo realOn Control of Drawdown: Robust Invariance and Optimality
Our first result is an exact robust-invariance theorem characterizing every control action that preserves a prescribed drawdown limit against all supported returns.
PreprintNear-Optimal Acceleration for Smooth / Nondual Convex First-Order Oracle Optimization
We couple that movement with H\"older descent yielding a polynomial-runtime first-order method whose feasible output, in the high-dimensional regime and for , has error after queries to a first-order oracle, solving the COLT 2015 open problem of (Guz15), up to logarithmic factors.
PreprintSterile Insect Technique in a Metapopulation Model. Impact of Network Structure, Male Annihilation Technique and Entomopathogenic Fungi on the Release Strategies
The main contribution of this work is to identify efficient spatial release strategies for population elimination under practical constraints, in combination with other control methods.
PreprintUso en el mundo realOptimal Control of Traveler Testing in Epidemic Models
For the two country SIR case, we show the optimal control is bang bang by excluding singular arcs via Hamiltonian analysis and derive the optimal switching time.
PreprintUso en el mundo realTransformer-Informed Trajectory Optimization for Relative Motion in Cislunar Orbits
When evaluated on a set of simulated rendezvous scenarios that are initialized at perilune, ART-TWIN is demonstrated to substantially accelerate convergence and increase feasibility guarantees when used as a warm-start to sequential convex programming (SCP), compared to convex relaxations and the original ART.
PreprintUso en el mundo realOptimality of Affine Policies in Distributionally Robust Linear-Quadratic Control with Temporally Correlated Noise
Despite the infinite-dimensionality of both the policy space and ambiguity set, we prove that the optimal policy is affine and that the worst-case distribution is an affine push-forward of the nominal distribution.
PreprintInterference-Driven Clustered Optimisation for FM Spectrum Coordination
This paper proposes an interference-driven clustered optimisation framework for large-scale FM spectrum coordination.
PreprintUso en el mundo realAnytime-Feasible Gradient Descent for Constrained Optimization Under Gradient Uncertainty
We develop an anytime-feasible first-order method for nonlinear constrained optimization under norm-bounded errors in the objective and constraint gradients.
PreprintUso en el mundo realGoal-Oriented Communication and Control Co-Design via Semantic Push-Pull in Industrial IoT
To bridge this gap, we propose a communication-control co-design framework governed by a 6G Semantic Layer that independently arbitrates uplink and downlink resources.
PreprintAfirmaciones fuertes, leer con cuidadoUso en el mundo realConnections Between Quadratic Transform for Fractional Programming and Schur Complement
This paper shows that there are intimate connections between the quadratic transform technique for solving fractional programming (FP) problems and the Schur-complement technique in matrix analysis.
PreprintUnit commitment constrained Nash equilibrium in power markets
This paper considers unit commitment constrained Nash equilibria.
PreprintEfficient Geometry Representation Strategies for the Shape Optimization of Profile Extrusion Dies
To address these challenges, we present a deterministic and explainable framework for automatic die design based on adjoint-based shape optimization.
PreprintUso en el mundo realContextual Distributionally Robust Chance-Constrained Programs: Exact Reformulations and Valid Inequalities
For affine safety systems with right-hand-side uncertainty, we derive an exact mixed-integer programming (MIP) reformulation.
PreprintSpectral-NFP: Certified Low-Rank Curvature Majorization for Accelerating WMMSE
We propose Spectral-NFP, which retains selected dominant curvature eigenpairs and uses a scaled identity matrix to bound the curvature on the remaining subspace from above.
PreprintUso en el mundo realWideband Physical Layer Security in Mixed Near-Field and Far-Field Communications
Moreover, we theoretically demonstrate that introducing frequency-selective AN into the system offers two key benefits: 1) it transforms originally insecure subcarriers into secure ones, and 2) it substantially improves the overall secrecy performance.
PreprintOnline Wideband MIMO Channel Reconstruction from Periodically Swept RBs via Incremental CP Updates
We develop an online canonical polyadic tracker with proximal block updates (CP-PBCD) that reconstructs the full channel after each narrow-RB acquisition.
PreprintUso en el mundo realData-Assimilation-Assisted Reinforcement Learning for Power Grid Control under Load Uncertainty
In both experiments, EnSF reduces load-estimation error and improves the resulting control performance in the simplified transmission network.
PreprintUso en el mundo realScalable Dynamic Pricing of Substitutable Products through Structure-Guided Policy Learning
Methodology / results: We develop two MNL-guided policy-learning approaches that replace the dynamic program with a statistical mapping from inventory states to pricing decisions.
PreprintThe Price of Covertness: Dual-Control Navigation in Uncertain Flows under Adversarial Sensing
The deadline-indexed value determines the covert-time frontier, while an exact sensitivity formula with respect to sensing quality shows that information acquired earlier along the route can reduce leakage incurred later, whereas information acquired later cannot reduce leakage already incurred.
PreprintReinforcement Learning in Operational Research: A Technical Review and Practical Roadmap
To address this gap, this paper presents a structured review of three key roles that RL plays in empowering OR: (i) solving sequential decision-making problems in dynamic environments, (ii) serving as an end-to-end solution method or as a component integrated within heuristic and exact OR methods for combinatorial optimization problems, and (iii) facilitating extended reality analysis through integration with digital twin systems.
PreprintDeterministic Smoothed MAP Detection for High-Dimensional MIMO Systems
We propose a deterministic smoothed maximum a posteriori (SMAP) framework for high-dimensional multiple-input multiple-output (MIMO) detection.
PreprintUso en el mundo realMaximal Multiplicity Method for Optimal Damping Problem
Using the Weyl--Horn theorem, we construct an explicit damping matrix that realizes the optimal asymptotic decay rate of the system.
PreprintCalibrating Sensing Drift in Tomographic Inversion
In this work, we present a novel optimization-based approach to calibrate a common yet challenging source of experimental error, the drifts of the scanning positions, while simultaneously reconstructing the object.
PreprintMatching Upper and Lower Bounds for Higher-Order Nonconvex Finite-Sum Optimization
We establish tight randomized higher-order oracle complexity for finding first-order stationary points of nonconvex finite sums.
PreprintCapacity Analysis and Joint Gaussian Beam Pattern Optimization for Positioning-Assisted Communications
In this work, we derive instantaneous and ergodic channel capacity approximations in closed forms for both two-dimensional and three-dimensional positioning-assisted beamforming systems.
PreprintUso en el mundo realInter-Temporal Price Constraints in Dynamic Pricing: Performance Guarantees Under Price Monotonicity and Promotion Fatigue
Letting be the smallest initial capacity of a resource and be the maximum number of resources used by a product, our policies have a performance guarantee of .
PreprintPinching Antenna-Assisted Full-Duplex Communication Systems
Simulation results reveal that the proposed PASS-assisted FD architecture significantly outperforms conventional fixed antenna arrays, achieving substantial sum-rate gains while effectively mitigating SI to enable FD operation.
PreprintUso en el mundo realDistributed Intraday Energy Management for 16.7-Hz Railway Power Systems---Part I: Theoretical Foundations
In a series of three papers, we propose a distributed intraday scenario planner for energy management in 16.7-Hz single-phase railway power systems, which is realized and tested as open-source Python package bahnstrom_ems v0.9.1~\cite{noroozi2026bahnstromems}.
PreprintUso en el mundo realBudget-Constrained Graph Augmentation for Robust Network Design via Kirchhoff Index Minimization
As a scalable alternative, we develop an exact-, budget-feasible greedy heuristic built on rank-one Laplacian updates and biharmonic-distance caching, and interpret its progress through a Bellman value-to-go benchmark with a conservative spectral lower bound on the local policy ratio.
PreprintUso en el mundo realData-Driven MPC with Adaptively Sampled Non-Expert Demonstrations: Performance Guarantees and Sample Complexity
We establish relative optimality guarantees with respect to the infinite-horizon optimal value function and derive sufficient MPC horizon conditions, together with sample complexity bounds, for achieving a prescribed relative error.
PreprintA Decentralized Partially Observable Team Decision Methodology with Delayed Information Sharing
We show that the resulting member-side solutions approximate the centralized team solution: despite partial observability, unknown dynamics, and delayed common information, each member recovers the corresponding component of an approximate team-optimal policy.
Preprint