Interior-point algorithms, penalty methods and equilibrium problems
From MaRDI portal
Publication:853552
DOI10.1007/s10589-005-3908-8zbMath1121.90124OpenAlexW2039659576MaRDI QIDQ853552
Hande Y. Benson, Arun Sen, Robert J. Vanderbei, David F. Shanno
Publication date: 17 November 2006
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.397.2401
Minimax problems in mathematical programming (90C47) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Interior-point methods (90C51)
Related Items
A survey of nonlinear robust optimization, A pivoting algorithm for linear programming with linear complementarity constraints, Feasibility problems with complementarity constraints, A robust combined trust region–line search exact penalty projected structured scheme for constrained nonlinear least squares, Algorithms for linear programming with linear complementarity constraints, The quasiparticle lifetime in a doped graphene sheet, A line search exact penalty method using steering rules, Nonlinear robust optimization via sequential convex bilevel programming, Interior-point methods for nonconvex nonlinear programming: cubic regularization, Steering exact penalty methods for nonlinear programming, Lifting mathematical programs with complementarity constraints, Interior-point methods for nonconvex nonlinear programming: Regularization and warmstarts, An exact primal-dual penalty method approach to warmstarting interior-point methods for linear programming, Primal-dual interior-point method for thermodynamic gas-particle partitioning, Penalty and relaxation methods for the optimal placement and operation of control valves in water supply networks, Infeasible constraint-reduced interior-point methods for linear optimization, Multilevel Optimization Modeling for Risk-Averse Stochastic Programming, Convexification techniques for linear complementarity constraints, A local search method for optimization problem with d.c. inequality constraints, Mixed integer nonlinear programming using interior-point methods, Operations research and optimization (ORO), MPEC Methods for Bilevel Optimization Problems, An algorithm for global solution to bi-parametric linear complementarity constrained linear programs
Uses Software
Cites Work
- Test examples for nonlinear programming codes
- An interior-point algorithm for nonconvex nonlinear programming
- Interior-point methods for nonconvex nonlinear programming: jamming and numerical testing
- Interior-point methods for nonconvex nonlinear programming: Filter methods and merit functions
- Convergence Properties of a Regularization Scheme for Mathematical Programs with Complementarity Constraints
- Mathematical Programs with Complementarity Constraints: Stationarity, Optimality, and Sensitivity
- Optimization and dynamical systems algorithms for finding equilibria of stochastic games
- Engineering and Economic Applications of Complementarity Problems
- Solving mathematical programs with complementarity constraints as nonlinear programs
- An Interior Point Algorithm for Large-Scale Nonlinear Programming
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- On the Global Convergence of a Filter--SQP Algorithm
- Unnamed Item
- Unnamed Item
