An aggregate deformation homotopy method for min-max-min problems with max-min constraints
From MaRDI portal
Publication:616792
DOI10.1007/S10589-008-9229-YzbMATH Open1208.90180OpenAlexW2059847493MaRDI QIDQ616792FDOQ616792
Publication date: 12 January 2011
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-008-9229-y
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithm 652
- A new polynomial-time algorithm for linear programming
- Semismooth and Semiconvex Functions in Constrained Optimization
- Existence of an interior pathway to a Karush-Kuhn-Tucker point of a nonconvex programming problem
- Adaptive Approximations and Exact Penalization for the Solution of Generalized Semi-infinite Min-Max Problems
- Polyhedral separability through successive LP
- Interior Methods for Nonlinear Optimization
- Algorithms for finite and semi-infinite Min-Max-Min problems using adaptive smoothing techniques
- Algorithms with adaptive smoothing for finite minimax problems
- Multiple instance classification via successive linear programming
- Nonconvex Structures in Nonlinear Programming
- Second-Order Necessary Conditions in Constrained Semismooth Optimization
- Smoothing method for minimax problems
- Theory of globally convergent probability-one homotopies for nonlinear programming
- An Aggregate Constraint Method for Non-Linear Programming
- A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties
- Iterative Solution of Augmented Systems Arising in Interior Methods
- A non-interior continuation method for generalized linear complementarity problems
- On the entropic regularization method for solving min-max problems with applications
- An Interior Point Method with a Primal-Dual Quadratic Barrier Penalty Function for Nonlinear Optimization
- Ill-Conditioning and Computational Error in Interior Methods for Nonlinear Programming
- A combined homotopy interior point method for general nonlinear programming problems
- On the Conversion of Optimization Problems with Max-Min Constraints to Standard Optimization Problems
- Regularized smoothing approximations to vertical nonlinear complementarity problems
- A property of piecewise smooth functions
- Properties of an interior embedding for solving nonlinear optimization problems
- Nonconvex piecewise-quadratic underestimation for global minimization
- A modified standard embedding with jumps in nonlinear optimization
- Continuous deformation of nonlinear programs
- On the conversion of optimization problems with max-min constraints to standard optimization problems
- The aggregate constraint homotopy method for nonconvex nonlinear programming
Cited In (6)
- Solving fixed-point problems with inequality and equality constraints via a non-interior point homotopy path-following method
- Stationarity conditions and their reformulations for mathematical programs with vertical complementarity constraints
- Global convergence analysis of the aggregate constraint homotopy method for nonlinear programming problems with both inequality and equality constraints
- A homotopy method based on penalty function for nonlinear semidefinite programming
- The inexact log-exponential regularization method for mathematical programs with vertical complementarity constraints
- The augmented Lagrangian method for mathematical programs with vertical complementarity constraints based on inexact Scholtes regularization
Uses Software
This page was built for publication: An aggregate deformation homotopy method for min-max-min problems with max-min constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q616792)
