On solving difference of convex functions programs with linear complementarity constraints

DOI10.1007/S10589-023-00487-YMaRDI QIDQ6166653zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• A study of the difference-of-convex approach for solving linear programs with complementarity constraints
• On the problem of minimizing a difference of polyhedral convex functions under linear constraints
• On convex quadratic programs with linear complementarity constraints
• Solution of general linear complementarity problems via nondifferentiable concave minimization
• Solving the linear complementarity problem through concave programming
• Solving cone-constrained convex programs by differential inclusions
• On linear programs with linear complementarity constraints
• Convexification techniques for linear complementarity constraints
• Convexification techniques for linear complementarity constraints
• Linearly constrained convex programming as unconstrained differentiable concave programming

Cites work

• A Branch and Bound Algorithm for the Bilevel Programming Problem
• A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
• A DC programming approach for solving the symmetric eigenvalue complementarity problem
• A New Relaxation Scheme for Mathematical Programs with Equilibrium Constraints
• A Sequential Smooth Penalization Approach to Mathematical Programs with Complementarity Constraints
• A complementarity-based partitioning and disjunctive cut algorithm for mathematical programming problems with equilibrium constraints
• A globally convergent sequential quadratic programming algorithm for mathematical programs with linear complementarity constraints
• A log-exponential smoothing method for mathematical programs with complementarity constraints
• A modified relaxation scheme for mathematical programs with complementarity constraints
• A new branch and bound algorithm for solving quadratic programs with linear complementarity constraints
• A new regularization method for mathematical programs with complementarity constraints with strong convergence properties
• A new regularization scheme for mathematical programs with complementarity constraints
• A smoothing method for mathematical programs with equilibrium constraints
• A study of the difference-of-convex approach for solving linear programs with complementarity constraints
• Classification model selection via bilevel programming
• Convergence analysis of difference-of-convex algorithm with subanalytic data
• Convergence properties of a regularization scheme for mathematical programs with complementarity constraints
• 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 programming techniques for solving a class of nonlinear bilevel programs
• Efficient DC programming approaches for the asymmetric eigenvalue complementarity problem
• Exact Penalization of Mathematical Programs with Equilibrium Constraints
• Exact penalty and error bounds in DC programming
• Exact penalty for mathematical programs with linear complementarity constraints
• Extension of quasi-Newton methods to mathematical programs with complementarity con\-straints
• Generalized stationary points and an interior-point method for mathematical programs with equilibrium constraints.
• Interior Methods for Mathematical Programs with Complementarity Constraints
• Large-Scale Molecular Optimization from Distance Matrices by a D.C. Optimization Approach
• Mathematical programs with cardinality constraints: reformulation by complementarity-type conditions and a regularization method
• Mathematical programs with complementarity constraints: stationarity, optimality, and sensi\-tivity.
• Merit-function piecewise SQP algorithm for mathematical programs with equilibrium constraints
• New branch-and-Cut algorithm for bilevel linear programming
• On linear programs with linear complementarity constraints
• On solving linear complementarity problems by DC programming and DCA
• On the global minimization of the value-at-risk
• Solving the quadratic eigenvalue complementarity problem by DC programming
• Some exact penalty results for nonlinear programs and mathematical programs with equilibrium constraints
• Some properties of the bilevel programming problem
• Stochastic difference-of-convex-functions algorithms for nonconvex programming
• The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
• The eigenvalue complementarity problem

Cited in

(4)

• On solving linear complementarity problems by DC programming and DCA
• A study of the difference-of-convex approach for solving linear programs with complementarity constraints
• Comparing one-parametric schemes for solving mathematical programs with complementarity constraints: limit points, continuation and numerical experiences
• Convexification techniques for linear complementarity constraints

This page was built for publication: On solving difference of convex functions programs with linear complementarity constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6166653)