Cover Image

A smoothing moving balls approximation method for a class of conic-constrained difference-of-convex optimization problems

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Xu, Jiefeng, Pong, Ting Kei, Sze, Nung-sing
Format:	Preprint
Published:	2025
Subjects:	Optimization and Control
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

A stochastic moving ball approximation method for smooth convex constrained minimization
by: Singh, Nitesh Kumar, et al.
Published: (2024)

Frank-Wolfe-type methods for a class of nonconvex inequality-constrained problems
by: Zeng, Liaoyuan, et al.
Published: (2021)

Subdifferentially polynomially bounded functions and Gaussian smoothing-based zeroth-order optimization
by: Lei, Ming, et al.
Published: (2024)

Stochastic smoothing accelerated gradient method for general constrained nonsmooth convex composite optimization
by: Wang, Ruyu, et al.
Published: (2023)

Moving higher-order Taylor approximations method for smooth constrained minimization problems
by: Nabou, Yassine, et al.
Published: (2024)

A single-loop proximal-conditional-gradient penalty method
by: Zhang, Hao, et al.
Published: (2024)

Continuous and discrete-time accelerated methods for an inequality constrained convex optimization problem
by: Liu, Juan, et al.
Published: (2024)

Burer-Monteiro factorizability of nuclear norm regularized optimization
by: Ouyang, Wenqing, et al.
Published: (2025)

A stochastic perturbed augmented Lagrangian method for smooth convex constrained minimization
by: Singh, Nitesh Kumar, et al.
Published: (2025)

On quasi-convex smooth optimization problems by a comparison oracle
by: Gasnikov, A. V., et al.
Published: (2024)

Learning based convex approximation for constrained parametric optimization
by: Liu, Kang, et al.
Published: (2025)

Complexity and convergence analysis of a single-loop SDCAM for Lipschitz composite optimization and beyond
by: Zhang, Hao, et al.
Published: (2025)

A semi-smooth Newton method for the nonlinear conic problem with generalized simplicial cones
by: Armijo, Nicolas F., et al.
Published: (2026)

A heavy-ball type curve search method for smooth convexly constrained optimization
by: Donnini, Federica, et al.
Published: (2026)

Generalized power cones: optimal error bounds and automorphisms
by: Lin, Ying, et al.
Published: (2022)

Stochastic dual coordinate descent with adaptive heavy ball momentum for linearly constrained convex optimization
by: Zeng, Yun, et al.
Published: (2023)

Convergence analysis for a variant of manifold proximal point algorithm based on Kurdyka-Łojasiewicz property
by: Yu, Peiran, et al.
Published: (2025)

Error bounds for perspective cones of a class of nonnegative Legendre functions
by: Wang, Xiaozhou, et al.
Published: (2025)

An optimal first-order method for smooth and strongly convex composite optimization and its stationary limit
by: Upadhyaya, Manu, et al.
Published: (2026)

Tikhonov regularized second-order plus first-order primal-dual dynamical systems with asymptotically vanishing damping for linear equality constrained convex optimization problems
by: Zhu, Ting Ting, et al.
Published: (2023)

Stochastic halfspace approximation method for convex optimization with nonsmooth functional constraints
by: Singh, Nitesh Kumar, et al.
Published: (2024)

Online convex optimization for constrained control of nonlinear systems
by: Nonhoff, Marko, et al.
Published: (2024)

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

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

Multi-cut stochastic approximation methods for solving stochastic convex composite optimization
by: Liang, Jiaming, et al.
Published: (2025)

Feedback control of Lagrange multipliers for non-smooth constrained optimization
by: Cerone, V., et al.
Published: (2026)

A comparison on constrain encoding methods for quantum approximate optimization algorithm
by: Liu, Yiwen, et al.
Published: (2024)

Online convex optimization for robust control of constrained dynamical systems
by: Nonhoff, Marko, et al.
Published: (2024)

Alternating Direction Method of Multipliers for nonlinear constrained convex problems and applications to distributed resource allocation and constrained machine learning
by: Xiong, Zhengjie, et al.
Published: (2026)

On the approximation error for approximating convex bodies using multiobjective optimization
by: Löhne, Andreas, et al.
Published: (2021)

On leveraging constrained smooth additive regression models for global optimization
by: Cuesta, Marina, et al.
Published: (2025)

Proximal bundle methods for hybrid weakly convex composite optimization problems
by: Liang, Jiaming, et al.
Published: (2023)

A scalable mixed-integer conic optimization approach to cardinality-constrained Poisson regression with safe screening
by: Kurihara, Kota, et al.
Published: (2025)

A Near-optimal Method for Linearly Constrained Composite Non-convex Non-smooth Problems
by: Liu, Wei, et al.
Published: (2025)

Existence of optimal pairs for optimal control problems with states constrained to Riemannian manifolds
by: Deng, Li, et al.
Published: (2024)

A warmstarting technique for general conic optimization in interior point methods
by: Chen, Yuwen, et al.
Published: (2025)

Robust approximation of chance constrained optimization with polynomial perturbation
by: Rao, Bo, et al.
Published: (2022)

SSNCVX: A primal-dual semismooth Newton method for convex composite optimization problem
by: Deng, Zhanwang, et al.
Published: (2025)

A globalized inexact semismooth Newton method for strongly convex optimal control problems
by: Wachsmuth, Daniel
Published: (2025)

Online convex optimization for constrained control of linear systems using a reference governor
by: Nonhoff, Marko, et al.
Published: (2022)