Pages that link to "Item:Q2365344"
From MaRDI portal
The following pages link to Exact penalization and stationarity conditions of mathematical programs with equilibrium constraints (Q2365344):
Displaying 50 items.
- Characterizations of linear suboptimality for mathematical programs with equilibrium constraints (Q1016353) (← links)
- Solving bilevel linear programs using multiple objective linear programming (Q1016404) (← links)
- Hybrid conjugate gradient method for a convex optimization problem over the fixed-point set of a nonexpansive mapping (Q1016416) (← links)
- Well-posedness for equilibrium problems and for optimization problems with equilibrium constraints (Q1031699) (← links)
- Two-step iterative algorithms for hierarchical fixed point problems and variational inequality problems (Q1034982) (← links)
- DC programming and DCA for globally solving the value-at-risk (Q1035285) (← links)
- On some regularity properties in variational analysis (Q1044249) (← links)
- Sensitivity analysis of composite piecewise smooth equations (Q1356062) (← links)
- Error bounds in mathematical programming (Q1365060) (← links)
- Some exact penalty results for nonlinear programs and mathematical programs with equilibrium constraints (Q1407235) (← links)
- New relaxation method for mathematical programs with complementarity constraints (Q1407237) (← links)
- Global optimization for transport network expansion and signal setting (Q1665561) (← links)
- Exact penalization and necessary optimality conditions for multiobjective optimization problems with equilibrium constraints (Q1724601) (← links)
- Optimization approaches to supervised classification (Q1753623) (← links)
- Stationarity conditions and their reformulations for mathematical programs with vertical complementarity constraints (Q1762397) (← links)
- Global Lipschitzian error bounds for semidefinite complementarity problems with emphasis on NCPs (Q1765864) (← links)
- A modified relaxation scheme for mathematical programs with complementarity constraints (Q1772964) (← links)
- Global optimization method for solving mathematical programs with linear complementarity constraints (Q1777600) (← links)
- Complementarity formulations and existence of solutions of dynamic multi-rigid-body contact problems with Coulomb friction (Q1919101) (← links)
- On regular coderivatives in parametric equilibria with non-unique multipliers (Q1925780) (← links)
- Notes on some constraint qualifications for mathematical programs with equilibrium constraints (Q1949561) (← links)
- On the solution of a minimum weight elastoplastic problem involving displacement and complementarity constraints (Q1965225) (← links)
- A solution method for semivectorial bilevel programming problem via penalty method (Q2251733) (← links)
- Generalized limit analysis in poroplasticity by mathematical programming (Q2267959) (← links)
- On the convergence properties of modified augmented Lagrangian methods for mathematical programming with complementarity constraints (Q2269590) (← links)
- Two new weak constraint qualifications for mathematical programs with equilibrium constraints and applications (Q2275327) (← links)
- Tikhonov regularization for mathematical programs with generalized complementarity constraints (Q2354478) (← links)
- A superlinearly convergent SQP algorithm for mathematical programs with linear complementarity constraints (Q2369090) (← links)
- On convex quadratic programs with linear complementarity constraints (Q2377168) (← links)
- \(l_{p}\)-norm regularization method (\( 0<p<1 \)) and DC programming for correction system of inconsistency linear inequalities (Q2415905) (← links)
- Mathematical programming approaches for the safety assessment of semirigid elastoplastic frames (Q2428337) (← links)
- Bounded sets of KKT multipliers in vector optimization (Q2433929) (← links)
- \(\alpha\)-well-posedness for Nash equilibria and for optimization problems with Nash equilibrium constraints (Q2433930) (← links)
- A branch-and-bound method for discretely-constrained mathematical programs with equilibrium constraints (Q2442073) (← links)
- Bilevel invex equilibrium problems with applications (Q2448130) (← links)
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (Q2448160) (← links)
- Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs (Q2465653) (← links)
- New branch-and-Cut algorithm for bilevel linear programming (Q2471104) (← links)
- Necessary and sufficient conditions for linear suboptimality in constrained optimization (Q2481102) (← links)
- A nonconvex dissipative system and its applications. I (Q2481364) (← links)
- Merit-function piecewise SQP algorithm for mathematical programs with equilibrium constraints (Q2483036) (← links)
- A robust SQP method for mathematical programs with linear complementarity constraints (Q2506190) (← links)
- On M-stationary points for mathematical programs with equilibrium constraints (Q2566118) (← links)
- Collusive game solutions via optimization (Q2576729) (← links)
- An exact penalty approach for optimization with nonnegative orthogonality constraints (Q2687065) (← links)
- A two-level distributed algorithm for nonconvex constrained optimization (Q2696920) (← links)
- Optimality conditions for nonsmooth mathematical programs with equilibrium constraints, using convexificators (Q2790868) (← links)
- On Efficiency Conditions for Nonsmooth Vector Equilibrium Problems with Equilibrium Constraints (Q2795107) (← links)
- A unifying theory of exactness of linear penalty functions (Q2810116) (← links)
- Analysis of M-stationary points to an EPEC modeling oligopolistic competition in an electricity spot market (Q2911436) (← links)
