A method of centres for DC-constrained DC optimization programs
From MaRDI portal
Cites work
- A Method of Centers with Approximate Subgradient Linearizations for Nonsmooth Convex Optimization
- An Infeasible Bundle Method for Nonsmooth Convex Constrained Optimization without a Penalty Function or a Filter
- Combined phase I—phase II methods of feasible directions
- Constrained bundle methods for upper inexact oracles with application to joint chance constrained energy problems
- Convex analysis and global optimization
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC programming and DCA for general DC programs
- DC programming and DCA: thirty years of developments
- DC semidefinite programming and cone constrained DC optimization. I: Theory
- DC semidefinite programming and cone constrained DC optimization. II: Local search methods
- Dual method of centers for solving generalized fractional programs
- Duality results and dual bundle methods based on the dual method of centers for minimax fractional programs
- Global convergence and rate of convergence of a method of centers
- Global optimality conditions and exact penalization
- Global optimality conditions in nonconvex optimization
- scientific article; zbMATH DE number 439380 (Why is no real title available?)
- scientific article; zbMATH DE number 3950216 (Why is no real title available?)
- scientific article; zbMATH DE number 4032473 (Why is no real title available?)
- scientific article; zbMATH DE number 4041643 (Why is no real title available?)
- scientific article; zbMATH DE number 2076851 (Why is no real title available?)
- scientific article; zbMATH DE number 3400681 (Why is no real title available?)
- Introduction to nonsmooth optimization. Theory, practice and software
- Method of centers for generalized fractional programming
- Methods of descent for nondifferentiable optimization
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- On the convergence of an approximate proximal method for DC functions
- On the rate of convergence of certain methods of centers
- Optimization and nonsmooth analysis
- Programmation mathématique convexe
- Prox-regularization of the dual method of centers for generalized fractional programs
- Proximal bundle algorithms for nonlinearly constrained convex minimax fractional programs
- Some properties of methods of centers
- Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Unified steerable phase I-phase II method of feasible directions for semi-infinite optimization
This page was built for publication: A method of centres for DC-constrained DC optimization programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7391957)
