The semismooth approach for semi-infinite programming under the reduction ansatz
From MaRDI portal
Publication:933800
DOI10.1007/s10898-007-9228-zzbMath1176.90593OpenAlexW2032951014MaRDI QIDQ933800
Publication date: 25 July 2008
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-007-9228-z
generalized semi-infinite optimizationsemismooth Newton methodNCP functionreduction ansatzCD regularity
Optimality conditions and duality in mathematical programming (90C46) Numerical methods based on necessary conditions (49M05) Newton-type methods (49M15) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Semi-infinite programming (90C34)
Related Items
A smoothing Levenberg-Marquardt method for generalized semi-infinite programming, How to solve a semi-infinite optimization problem, Sufficient optimality and sensitivity analysis of a parameterized min-max programming, A new smoothing Newton-type algorithm for semi-infinite programming, Gauss-Newton-type methods for bilevel optimization, On optimization, dynamics and uncertainty: A tutorial for gene-environment networks, An exchange method with refined subproblems for convex semi-infinite programming problems, Interior point filter method for semi-infinite programming problems
Cites Work
- Unnamed Item
- Unnamed Item
- Generalized semi-infinite programming: a tutorial
- On inertia and Schur complement in optimization
- Schur complements and statistics
- Robust solutions of uncertain linear programs
- Nonsmooth equations in optimization. Regularity, calculus, methods and applications
- Semismooth Newton methods for solving semi-infinite programming problems
- Bi-level strategies in semi-infinite programming.
- A nonsmooth version of Newton's method
- Semi-Infinite Programming: Theory, Methods, and Applications
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- Optimization and nonsmooth analysis
- Critical sets in parametric optimization
- Generalized equations and their solutions, part II: Applications to nonlinear programming
- Semismooth and Semiconvex Functions in Constrained Optimization
- Semismooth Karush-Kuhn-Tucker Equations and Convergence Analysis of Newton and Quasi-Newton Methods for Solving these Equations
- On Generic One-Parametric Semi-Infinite Optimization
- On sufficient conditions for local optimality in semi-infinite programming
- Second order optimality conditions for generalized semi-infinite programming problems
