Skip to content

Optimization Online

  • Welcome
  • Repository
  • Submit
  • About
  • Help
  • My Eprints

Complexity analysis of inexact cubic-regularized primal-dual methods for finding second-order stationary points

Published: 2024/04/25, Updated: 2024/09/24
  • Xiao Wang
    • Categories Constrained Nonlinear Optimization, Nonlinear Optimization Short URL: https://optimization-online.org/?p=26293

    Article

    Download

    View PDF

    Post navigation
    Solving the three-dimensional open-dimension rectangular packing problem: a constraint programming model
    Edge expansion of a graph: SDP-based computational strategies
    Log in

    Repository

    Author List

    Months

    Categories

    Keywords

    alternating direction method of multipliers augmented lagrangian method bilevel optimization Branch-and-Bound branch-and-cut chance constraints column generation combinatorial optimization complexity conic optimization convergence rate convex optimization cutting planes decomposition derivative-free optimization distributionally robust optimization duality dynamic programming first-order methods global convergence global optimization heuristics integer programming interior point methods large-scale optimization linear programming machine learning mixed-integer linear programming mixed-integer nonlinear programming mixed-integer programming multiobjective optimization nonconvex optimization nonlinear optimization nonlinear programming nonsmooth optimization optimal control optimization proximal point algorithm quadratic programming robust optimization semidefinite programming stochastic optimization stochastic programming trust-region methods unconstrained optimization

    © 2024 Optimization Online • Child Theme of GeneratePress
    For feedback or questions, contact optonline@wid.wisc.edu.