Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints

DOI10.1080/10556788.2023.2167992zbMath1522.90122arXiv2107.01433OpenAlexW4319792579MaRDI QIDQ6113525

Maksim V. Dolgopolik

Publication date: 9 August 2023

Published in: Optimization Methods and Software (Search for Journal in Brave)

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

zbMATH Keywords

DCAexact penalty methodDC functionnonsmooth optimisationDC optimisation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Derivative-free methods and methods using generalized derivatives (90C56)

Cites Work

• Unnamed Item
• Unnamed Item
• A line search exact penalty method using steering rules
• Codifferential method for minimizing nonsmooth DC functions
• On a class of nonsmooth optimal control problems
• Decomposition methods for solving nonconvex quadratic programs via branch and bound
• Reverse convex programming
• A branch and bound method via d. c. optimization algorithms and ellipsoidal technique for box constrained nonconvex quadratic problems
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Bundle-based descent method for nonsmooth multiobjective DC optimization with inequality constraints
• DC programming and DCA: thirty years of developments
• 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
• Aggregate subgradient method for nonsmooth DC optimization
• A bundle method for nonsmooth DC programming with application to chance-constrained problems
• DC semidefinite programming and cone constrained DC optimization. I: Theory
• Metric regularity of quasidifferentiable mappings and optimality conditions for nonsmooth mathematical programming problems
• Proximal bundle methods for nonsmooth DC programming
• An inertial algorithm for DC programming
• Nonsmooth and nonconvex optimization via approximate difference-of-convex decompositions
• Aggregate codifferential method for nonsmooth DC optimization
• Variations and extension of the convex-concave procedure
• A proximal bundle method for nonsmooth DC optimization utilizing nonconvex cutting planes
• A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
• A numerical approach for solving some convex maximization problems
• Numerical solution for optimization over the efficient set by d.c. optimization algorithms
• On a nonseparable convex maximization problem with continuous Knapsack constraints
• A unifying theory of exactness of linear penalty functions
• Introduction to Nonsmooth Optimization
• Graph Implementations for Nonsmooth Convex Programs
• DC Programming and DCA for General DC Programs
• Steering exact penalty methods for nonlinear programming
• Methods for Global Concave Minimization: A Bibliographic Survey
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Double Bundle Method for finding Clarke Stationary Points in Nonsmooth DC Programming
• A New Constraint Qualification and Sharp Optimality Conditions for Nonsmooth Mathematical Programming Problems in Terms of Quasidifferentials
• First-Order Methods for Nonconvex Quadratic Minimization
• Non-smooth DC-constrained optimization: constraint qualification and minimizing methodologies

This page was built for publication: Steering exact penalty DCA for nonsmooth DC optimisation problems with equality and inequality constraints