Optimization conditions and decomposable algorithms for convertible nonconvex optimization

DOI10.23952/jnva.7.2023.1.07OpenAlexW4311163083MaRDI QIDQ5058177

Zhiqing Meng, Min Jiang, Chuangyin Dang, Rui Shen

Publication date: 19 December 2022

Published in: Journal of Nonlinear and Variational Analysis (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2202.07316

zbMATH Keywords

optimization conditionsunconstrained optimization problemsdecomposable algorithmweak uniform convertible nonconvex function

Mathematics Subject Classification ID

Operator theory (47-XX) Functional analysis (46-XX)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Subdifferentiation of regularized functions
• Extended reverse-convex programming: an approximate enumeration approach to global optimization
• Cutting plane oracles to minimize non-smooth non-convex functions
• Computing proximal points of nonconvex functions
• Some transformation techniques with applications in global optimization
• Morse theory for some lower-\(C^ 2\) functions in finite dimension
• Second-order sensitivity analysis in factorable programming: Theory and applications
• Global optimization of nonconvex problems with convex-transformable intermediates
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• Explicit convex and concave envelopes through polyhedral subdivisions
• A review on deep learning in medical image reconstruction
• A new framework to relax composite functions in nonlinear programs
• Intersection cuts for factorable MINLP
• Global optimization of nonconvex problems with multilinear intermediates
• Complexity of unconstrained \(L_2 - L_p\) minimization
• Functions and sets of smooth substructure: relationships and examples
• Introduction to Nonsmooth Optimization
• Lower Bound Theory of Nonzero Entries in Solutions of $\ell_2$-$\ell_p$ Minimization
• A Redistributed Proximal Bundle Method for Nonconvex Optimization
• Coderivative characterizations of maximal monotonicity for set-valued mappings
• Jointly Constrained Biconvex Programming
• Optimization and nonsmooth analysis
• Submonotone Subdifferentials of Lipschitz Functions
• Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems
• Variational Analysis
• A Method for Minimization of Quasidifferentiable Functions
• Optimization of Complex Systems: Theory, Models, Algorithms and Applications
• Global optimization of nonconvex factorable programming problems
• A proximal bundle method for nonsmooth nonconvex functions with inexact information

This page was built for publication: Optimization conditions and decomposable algorithms for convertible nonconvex optimization