Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
From MaRDI portal
Publication:1630269
DOI10.1007/s10898-018-0651-0zbMath1414.90317OpenAlexW2796925970MaRDI QIDQ1630269
Publication date: 7 December 2018
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-018-0651-0
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Multi-objective and goal programming (90C29)
Related Items (5)
The ABC of DC programming ⋮ Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints ⋮ Sequential difference-of-convex programming ⋮ A class of infeasible proximal bundle methods for nonsmooth nonconvex multi-objective optimization problems ⋮ A bundle method for nonsmooth DC programming with application to chance-constrained problems
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Proximal point algorithms for multi-criteria optimization with the difference of convex objective functions
- On numerical solving the spherical separability problem
- On functions representable as a difference of convex functions
- Optimality conditions for vector optimization problems of a difference of convex mappings
- Proximity control in bundle methods for convex nondifferentiable minimization
- Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
- Nonconvex optimization in mechanics. Algorithms, heuristics and engineering applications by the F. E. M
- A production-transportation problem with stochastic demand and concave production costs
- Nonlinear multiobjective optimization
- Solving a class of linearly constrained indefinite quadratic problems by DC algorithms
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- Sufficient optimality condition for vector optimization problems under D.C. data
- Visualizing data as objects by DC (difference of convex) optimization
- Minimizing nonsmooth DC functions via successive DC piecewise-affine approximations
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- DC programming: overview.
- Multiobjective DC programs with infinite convex constraints
- Nonsmooth multiobjective programming with quasi-Newton methods
- A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
- A new nonsmooth optimization algorithm for minimum sum-of-squares clustering problems
- Introduction to Nonsmooth Optimization
- On Nonsmooth Multiobjective Optimality Conditions with Generalized Convexities
- An aggregate subgradient method for nonsmooth convex minimization
- A Strongly Convergent Method for Nonsmooth Convex Minimization in Hilbert Spaces
- Optimization and nonsmooth analysis
- Algorithms for multicriterion optimization
- A Version of the Bundle Idea for Minimizing a Nonsmooth Function: Conceptual Idea, Convergence Analysis, Numerical Results
- Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming
- Interactive bundle-based method for nondifferentiable multiobjeective optimization: nimbus§
- Proximal Methods in Vector Optimization
- Optimizing sensor cover energy via DC programming
This page was built for publication: Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
