A class of mathematical programs with equilibrium constraints: a smooth algorithm and applications to contact problems

DOI10.1007/s11081-005-6796-yzbMath1093.90082OpenAlexW2059977212MaRDI QIDQ2575248

Silvério S. Rosa, Isabel M. Narra Figueiredo, Joaquim Joao Júdice

Publication date: 8 December 2005

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11081-005-6796-y

zbMATH Keywords

finite elementsstructural optimizationnonlinear programmingcomplementarity problemscontact problems

Mathematics Subject Classification ID

Minimax problems in mathematical programming (90C47) Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)

Related Items

A survey on the continuous nonlinear resource allocation problem

Uses Software

• Matlab
• CALFEM

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite-dimensional variational inequality and nonlinear complementarity problems: A survey of theory, algorithms and applications
• An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
• On the continuous quadratic knapsack problem
• Nonsmooth approach to optimization problems with equilibrium constraints. Theory, applications and numerical results
• A block principal pivoting algorithm for large-scale strictly monotone linear complementarity problems
• An investigation of interior-point and block pivoting algorithms for large-scale symmetric monotone linear complementarity problems
• A polynomially bounded algorithm for a singly constrained quadratic program
• Numerical Optimization
• Mathematical Programs with Equilibrium Constraints