Cover Image

EM algorithms for optimization problems with polynomial objectives

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Asai, Kensuke, Gotoh, Jun-ya
Format:	Preprint
Published:	2024
Subjects:	Optimization and Control Computation
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Exact Penalization at D-Stationary Points of Cardinality- or Rank-Constrained Problem
by: Yagishita, Shotaro, et al.
Published: (2022)

Robustness Measures in Distributionally Robust Optimization
by: Gotoh, Jun-ya, et al.
Published: (2025)

Posterior and Likelihood Sensitivity in Bayesian Distributionally Robust Optimization
by: Gotoh, Jun-ya, et al.
Published: (2026)

On a class of interdiction problems with partition matroids: complexity and polynomial-time algorithms
by: Ketkov, Sergey S., et al.
Published: (2024)

Degree reduction techniques for polynomial optimization problems
by: González-Rodríguez, Brais, et al.
Published: (2024)

Solving moment and polynomial optimization problems on Sobolev spaces
by: Henrion, Didier, et al.
Published: (2024)

A polynomial-time solvable class of sparse box-constrained polynomial optimization problems
by: Khajavirad, Aida
Published: (2026)

Slow convergence of the moment-SOS hierarchy for an elementary polynomial optimization problem
by: Henrion, Didier, et al.
Published: (2024)

A robust BFGS algorithm for unconstrained nonlinear optimization problems
by: Yang, Yaguang
Published: (2012)

Accelerated projected gradient algorithms for sparsity constrained optimization problems
by: Alcantara, Jan Harold, et al.
Published: (2022)

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

A new polynomially solvable class of quadratic optimization problems with box constraints
by: Hladík, Milan, et al.
Published: (2019)

A Consensus-based optimization algorithm using Gaussian processes for global optimization problems in Sobolev spaces
by: Khatab, Mahmoud, et al.
Published: (2026)

Global convergence of a BFGS-type algorithm for nonconvex multiobjective optimization problems
by: Prudente, L. F., et al.
Published: (2023)

Modified Armijo line search in optimization on Riemannian submanifolds with reduced computational cost
by: Sato, Hiroyuki, et al.
Published: (2023)

A strongly polynomial-time algorithm for the general linear programming problem
by: Awoniyi, Samuel
Published: (2025)

Research on the descent direction of prediction correction algorithms for pseudo-convex/convex optimization problems
by: Li, Ting, et al.
Published: (2025)

An introduction to variational quantum algorithms for combinatorial optimization problems
by: Grange, Camille, et al.
Published: (2022)

Gradient-based algorithms for multi-objective bi-level optimization
by: Yang, Xinmin, et al.
Published: (2024)

Hardness of some optimization problems over correlation polyhedra
by: Caprara, Alberto, et al.
Published: (2026)

Parabolic optimal control problems with combinatorial switching constraints -- Part III: Branch-and-bound algorithm
by: Buchheim, Christoph, et al.
Published: (2024)

Parabolic optimal control problems with combinatorial switching constraints -- Part II: Outer approximation algorithm
by: Buchheim, Christoph, et al.
Published: (2022)

Automated algorithm design for convex optimization problems with linear equality constraints
by: Ozaslan, Ibrahim K., et al.
Published: (2025)

Homogenization for polynomial optimization with unbounded sets
by: Huang, Lei, et al.
Published: (2021)

Global optimization of low-rank polynomials
by: Gaggioli, Llorenç Balada, et al.
Published: (2025)

A deterministic optimization algorithm for nonconvex and combinatorial bi-objective programming
by: Lee, Ye Seol, et al.
Published: (2024)

On analysis of open optimization algorithms
by: Eising, Jaap, et al.
Published: (2024)

First-order algorithms for robust optimization problems via convex-concave saddle-point Lagrangian reformulation
by: Postek, Krzysztof, et al.
Published: (2021)

Alternating direction method of multipliers for polynomial optimization
by: Cerone, V., et al.
Published: (2025)

A deep primal-dual BSDE method for optimal stopping problems
by: Yang, Jiefei, et al.
Published: (2024)

Modified FOX Optimizer for Solving optimization problems
by: Hasan, Dler O., et al.
Published: (2025)

Convergence rates for polynomial optimization on set products
by: Magron, Victor
Published: (2025)

Composition and tensor train structure in polynomial optimization
by: Gaggioli, Llorenç Balada, et al.
Published: (2026)

A novel exact approach to polynomial optimization
by: Bertsimas, Dimitris, et al.
Published: (2025)

A topological derivative-based algorithm to solve optimal control problems with $L^0(Ω)$ control cost
by: Wachsmuth, Daniel
Published: (2022)

Sinkhorn algorithms and linear programming solvers for optimal partial transport problems
by: Bai, Yikun
Published: (2024)

Parameter estimation of hidden Markov models: comparison of EM and quasi-Newton methods with a new hybrid algorithm
by: Foulon, Sidonie, et al.
Published: (2024)

Primal-Dual Damping algorithms for optimization
by: Zuo, X., et al.
Published: (2023)

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

Two-stage stochastic algorithm for solving large-scale (non)-convex separable optimization problems under affine constraints
by: Dubois-Taine, Benjamin, et al.
Published: (2026)