Global optimization for non-convex programs via convex proximal point method
From MaRDI portal
Publication:2691402
DOI10.3934/jimo.2022142OpenAlexW4291016507MaRDI QIDQ2691402
Publication date: 29 March 2023
Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3934/jimo.2022142
Cites Work
- Unnamed Item
- Unnamed Item
- A proximal alternating direction method of multipliers for a minimization problem with nonconvex constraints
- An eigenvalue decomposition based branch-and-bound algorithm for nonconvex quadratic programming problems with convex quadratic constraints
- Alternating direction method of multipliers for a class of nonconvex bilinear optimization: convergence analysis and applications
- A scalarization proximal point method for quasiconvex multiobjective minimization
- Quadratic programming with one negative eigenvalue is NP-hard
- Proximal point methods and nonconvex optimization
- Global convergence of proximal iteratively reweighted algorithm
- Proximal point method for a special class of nonconvex multiobjective optimization functions
- A polyhedral study of nonconvex quadratic programs with box constraints
- A new infeasible proximal bundle algorithm for nonsmooth nonconvex constrained optimization
- A filter proximal bundle method for nonsmooth nonconvex constrained optimization
- General inertial proximal gradient method for a class of nonconvex nonsmooth optimization problems
- Perturbed proximal primal-dual algorithm for nonconvex nonsmooth optimization
- A sensitive-eigenvector based global algorithm for quadratically constrained quadratic programming
- A generalized proximal point algorithm for certain non-convex minimization problems
- Monotone Operators and the Proximal Point Algorithm
- Partial Proximal Minimization Algorithms for Convex Pprogramming
- Variational Analysis
- Minimizing Nonconvex Nonsmooth Functions via Cutting Planes and Proximity Control
- The trust region subproblem and semidefinite programming*
- Restricted Step and Levenberg–Marquardt Techniques in Proximal Bundle Methods for Nonconvex Nondifferentiable Optimization
- A Proximal Alternating Direction Method of Multiplier for Linearly Constrained Nonconvex Minimization
- Alternating Structure-Adapted Proximal Gradient Descent for Nonconvex Nonsmooth Block-Regularized Problems
- Convex Analysis
- Convex analysis and monotone operator theory in Hilbert spaces
- A proximal bundle method based on approximate subgradients
This page was built for publication: Global optimization for non-convex programs via convex proximal point method
