Global convergence of ADMM in nonconvex nonsmooth optimization
In this paper, we analyze the convergence of the alternating direction method of multipliers
(ADMM) for minimizing a nonconvex and possibly nonsmooth objective function, ϕ (x_0 …
(ADMM) for minimizing a nonconvex and possibly nonsmooth objective function, ϕ (x_0 …
A fast constrained state transition algorithm
When solving constrained optimization problems in real industrial processes, both optimality
and computational efficiency need to be considered. However, most existing meta-heuristic …
and computational efficiency need to be considered. However, most existing meta-heuristic …
International portfolio optimization with second-order stochastic dominance and cardinality constraints
Y Mei, M Zheng, G Li, J Liu - Journal of Industrial and Management …, 2025 - aimsciences.org
In this paper, we introduce a stochastic optimization model for international investments,
specifically addressing scenarios where the investor's utility function is characterized by …
specifically addressing scenarios where the investor's utility function is characterized by …
Second-Order Necessary Conditions, Constraint Qualifications and Exact Penalty for Mathematical Programs with Switching Constraints
J Chen, L Liu, Y Lv, K Zhao - arxiv preprint arxiv:2407.17285, 2024 - arxiv.org
In this paper, we investigate second-order necessary conditions and exact penalty of
mathematical programs with switching constraints (MPSC). Some new second-order …
mathematical programs with switching constraints (MPSC). Some new second-order …
A New Smoothing Method for Mathematical Programs with Complementarity Constraints Based on Logarithm‐Exponential Function
Y Chen, Z Wan - Mathematical Problems in Engineering, 2018 - Wiley Online Library
We present a new smoothing method based on a logarithm‐exponential function for
mathematical program with complementarity constraints (MPCC). Different from the existing …
mathematical program with complementarity constraints (MPCC). Different from the existing …
An Inexact Solution Approach for the Mathematical Program with Complementarity Constraints
H Azizi, A Kadrani - 2020 IEEE 6th International Conference on …, 2020 - ieeexplore.ieee.org
We propose an approach based on a penalty formulation and a relaxation scheme for
mathematical programs with complementarity constraints (MPCC). We discuss the …
mathematical programs with complementarity constraints (MPCC). We discuss the …
[PDF][PDF] A DCA for MPCCs converging to a S-stationary point
M Maréchal - cienciasbasicas.udp.cl
1 Introduction Page 1 A DCA for MPCCs converging to a S-stationary point Matthieu Maréchal
Instituto de Ciencias Básicas, Facultad de Ingenierıa y Ciencias, Universidad Diego Portales …
Instituto de Ciencias Básicas, Facultad de Ingenierıa y Ciencias, Universidad Diego Portales …
Polynomial mathematical programs with equilibrium constraints and semidefinite programming relaxations
L Jiao, JH Lee, TS Pham - arxiv preprint arxiv:1903.09534, 2019 - arxiv.org
This paper focuses on the study of a mathematical program with equilibrium constraints,
where the objective and the constraint functions are all polynomials. We present a method …
where the objective and the constraint functions are all polynomials. We present a method …
DCA based Approaches for Mathematical Programs with Equilibrium Constraints
TMT Nguyen - 2018 - theses.hal.science
In this dissertation, we investigate approaches based on DC (Difference of Convex
functions) programming and DCA (DC Algorithm) for mathematical programs with …
functions) programming and DCA (DC Algorithm) for mathematical programs with …