Skip to content

Optimization Online

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

A Smoothing SQP Framework for a Class of Composite $ Minimization over Polyhedron

Published: 2014/07/28
  • Yu-Hong Dai
  • Ya-Feng Liu
  • Shiqian Ma
  • Shuzhong Zhang
    • Categories Constrained Nonlinear Optimization, Nonsmooth Optimization Short URL: https://optimization-online.org/?p=12979

    The composite $L_q$ (0

    Article

    Download

    View PDF

    Post navigation
    Robust Block Coordinate Descent
    An efficient dimer method with preconditioning and linesearch
    Log in

    Repository

    Author List

    Months

    Categories

    Keywords

    alternating direction method of multipliers augmented lagrangian method benders decomposition bilevel optimization Branch-and-Bound branch-and-cut chance constraints column generation combinatorial optimization complexity 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

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