:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Asai, Kensuke, Gotoh, Jun-ya
Format:	Preprint
Publié:	2024
Sujets:	Optimization and Control Computation
Accès en ligne:	https://arxiv.org/abs/2412.20481
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Exact Penalization at D-Stationary Points of Cardinality- or Rank-Constrained Problem
par: Yagishita, Shotaro, et autres
Publié: (2022)

Robustness Measures in Distributionally Robust Optimization
par: Gotoh, Jun-ya, et autres
Publié: (2025)

Posterior and Likelihood Sensitivity in Bayesian Distributionally Robust Optimization
par: Gotoh, Jun-ya, et autres
Publié: (2026)

On a class of interdiction problems with partition matroids: complexity and polynomial-time algorithms
par: Ketkov, Sergey S., et autres
Publié: (2024)

Degree reduction techniques for polynomial optimization problems
par: González-Rodríguez, Brais, et autres
Publié: (2024)

Solving moment and polynomial optimization problems on Sobolev spaces
par: Henrion, Didier, et autres
Publié: (2024)

A polynomial-time solvable class of sparse box-constrained polynomial optimization problems
par: Khajavirad, Aida
Publié: (2026)

Reduction from the partition problem: Dynamic lot sizing problem with polynomial complexity
par: Sim, Chee-Khian
Publié: (2024)

A robust BFGS algorithm for unconstrained nonlinear optimization problems
par: Yang, Yaguang
Publié: (2012)

Accelerated projected gradient algorithms for sparsity constrained optimization problems
par: Alcantara, Jan Harold, et autres
Publié: (2022)

Slow convergence of the moment-SOS hierarchy for an elementary polynomial optimization problem
par: Henrion, Didier, et autres
Publié: (2024)

A new polynomially solvable class of quadratic optimization problems with box constraints
par: Hladík, Milan, et autres
Publié: (2019)

Modified Armijo line search in optimization on Riemannian submanifolds with reduced computational cost
par: Sato, Hiroyuki, et autres
Publié: (2023)

A Consensus-based optimization algorithm using Gaussian processes for global optimization problems in Sobolev spaces
par: Khatab, Mahmoud, et autres
Publié: (2026)

Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems
par: Prudente, L. F., et autres
Publié: (2023)

A strongly polynomial-time algorithm for the general linear programming problem
par: Awoniyi, Samuel
Publié: (2025)

An introduction to variational quantum algorithms for combinatorial optimization problems
par: Grange, Camille, et autres
Publié: (2022)

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

Hardness of some optimization problems over correlation polyhedra
par: Caprara, Alberto, et autres
Publié: (2026)

Research on the descent direction of prediction correction algorithms for pseudo-convex/convex optimization problems
par: Li, Ting, et autres
Publié: (2025)

Gradient-based algorithms for multi-objective bi-level optimization
par: Yang, Xinmin, et autres
Publié: (2024)

Parabolic optimal control problems with combinatorial switching constraints -- Part III: Branch-and-bound algorithm
par: Buchheim, Christoph, et autres
Publié: (2024)

Parabolic optimal control problems with combinatorial switching constraints -- Part II: Outer approximation algorithm
par: Buchheim, Christoph, et autres
Publié: (2022)

Modified FOX Optimizer for Solving optimization problems
par: Hasan, Dler O., et autres
Publié: (2025)

Alternating direction method of multipliers for polynomial optimization
par: Cerone, V., et autres
Publié: (2025)

Homogenization for polynomial optimization with unbounded sets
par: Huang, Lei, et autres
Publié: (2021)

Global optimization of low-rank polynomials
par: Gaggioli, Llorenç Balada, et autres
Publié: (2025)

On analysis of open optimization algorithms
par: Eising, Jaap, et autres
Publié: (2024)

A deep primal-dual BSDE method for optimal stopping problems
par: Yang, Jiefei, et autres
Publié: (2024)

Sinkhorn algorithms and linear programming solvers for optimal partial transport problems
par: Bai, Yikun
Publié: (2024)

Parameter estimation of hidden Markov models: comparison of EM and quasi-Newton methods with a new hybrid algorithm
par: Foulon, Sidonie, et autres
Publié: (2024)

First-order algorithms for robust optimization problems via convex-concave saddle-point Lagrangian reformulation
par: Postek, Krzysztof, et autres
Publié: (2021)

A deterministic optimization algorithm for nonconvex and combinatorial bi-objective programming
par: Lee, Ye Seol, et autres
Publié: (2024)

A polynomial projective algorithm for convex feasibility problems with positive-definite constraints
par: Chubanov, Sergei
Publié: (2025)

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

A direct optimization algorithm for input-constrained MPC
par: Wu, Liang, et autres
Publié: (2023)

Convergence rates for polynomial optimization on set products
par: Magron, Victor
Publié: (2025)

Composition and tensor train structure in polynomial optimization
par: Gaggioli, Llorenç Balada, et autres
Publié: (2026)

A novel exact approach to polynomial optimization
par: Bertsimas, Dimitris, et autres
Publié: (2025)

Primal-Dual Damping algorithms for optimization
par: Zuo, X., et autres
Publié: (2023)