On solving difference of convex functions programs with linear complementarity constraints

DOI10.1007/s10589-023-00487-yzbMath1522.90132OpenAlexW4367678100MaRDI QIDQ6166653

Hoai An Le Thi, Thi-Minh-Tam Nguyen, Tao Pham Dinh

Publication date: 3 August 2023

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-023-00487-y

zbMATH Keywords

penalty functionmathematical program with linear complementarity constraintsdifference of convex functions programmingdifference of convex functions algorithmdifference of convex functions constraints

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Cites Work

• On solving linear complementarity problems by DC programming and DCA
• Exact penalty and error bounds in DC programming
• A DC programming approach for solving the symmetric eigenvalue complementarity problem
• A log-exponential smoothing method for mathematical programs with complementarity constraints
• On linear programs with linear complementarity constraints
• A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints
• Generalized stationary points and an interior-point method for mathematical programs with equilibrium constraints.
• DC programming techniques for solving a class of nonlinear bilevel programs
• A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
• Some properties of the bilevel programming problem
• A smoothing method for mathematical programs with equilibrium constraints
• A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
• Convex analysis approach to d. c. programming: Theory, algorithms and applications
• Some exact penalty results for nonlinear programs and mathematical programs with equilibrium constraints
• Convergence analysis of difference-of-convex algorithm with subanalytic data
• DC programming and DCA: thirty years of developments
• A study of the difference-of-convex approach for solving linear programs with complementarity constraints
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• A modified relaxation scheme for mathematical programs with complementarity constraints
• Extension of quasi-Newton methods to mathematical programs with complementarity con\-straints
• New branch-and-Cut algorithm for bilevel linear programming
• Merit-function piecewise SQP algorithm for mathematical programs with equilibrium constraints
• The eigenvalue complementarity problem
• Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
• Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
• A New Regularization Method for Mathematical Programs with Complementarity Constraints with Strong Convergence Properties
• Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem
• A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
• DC Programming and DCA for General DC Programs
• A Branch and Bound Algorithm for the Bilevel Programming Problem
• Exact Penalization of Mathematical Programs with Equilibrium Constraints
• Exact penalty for mathematical programs with linear complementarity constraints
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
• On the global minimization of the value-at-risk
• A New Regularization Scheme for Mathematical Programs with Complementarity Constraints
• A Sequential Smooth Penalization Approach to Mathematical Programs with Complementarity Constraints
• Solving the Quadratic Eigenvalue Complementarity Problem by DC Programming
• Interior Methods for Mathematical Programs with Complementarity Constraints
• Classification model selection via bilevel programming
• Mathematical Programs with Cardinality Constraints: Reformulation by Complementarity-Type Conditions and a Regularization Method
• Stochastic Difference-of-Convex-Functions Algorithms for Nonconvex Programming