Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints
From MaRDI portal
Publication:740634
DOI10.1007/s10898-013-0063-0zbMath1327.90343OpenAlexW2030703267MaRDI QIDQ740634
Masao Fukushima, Takayuki Okuno
Publication date: 4 September 2014
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-013-0063-0
Related Items (5)
Primal-dual path following method for nonlinear semi-infinite programs with semi-definite constraints ⋮ S<i>l</i><sub>1</sub>QP Based Algorithm with Trust Region Technique for Solving Nonlinear Second-Order Cone Programming Problems ⋮ A discretization algorithm for nonsmooth convex semi-infinite programming problems based on bundle methods ⋮ An interior point sequential quadratic programming-type method for log-determinant semi-infinite programs ⋮ An exchange method with refined subproblems for convex semi-infinite programming problems
Uses Software
Cites Work
- Unnamed Item
- Semi-infinite programming
- Properties of equation reformulation of the Karush-Kuhn-Tucker condition for nonlinear second order cone optimization problems
- Applications of second-order cone programming
- A globally convergent SQP method for semi-infinite nonlinear optimization
- Discretization methods for the solution of semi-infinite programming problems
- Semismooth Newton methods for solving semi-infinite programming problems
- Second-order cone programming
- A smoothing Newton method for semi-infinite programming
- An SQP-type algorithm for nonlinear second-order cone programs
- Perturbation analysis of second-order cone programming problems
- Smoothing Functions for Second-Order-Cone Complementarity Problems
- Interior point filter method for semi-infinite programming problems
- Semi-Infinite Programming: Theory, Methods, and Applications
- An iterative method for solving KKT system of the semi-infinite programming
- A reduction method for semi-infinite programming by means of a global stochastic approach†
- The Adaptive Convexification Algorithm: A Feasible Point Method for Semi-Infinite Programming
- An Explicit Exchange Algorithm For Linear Semi-Infinite Programming Problems With Second-Order Cone Constraints
- A primal–dual interior point method for nonlinear optimization over second-order cones
- An implementation of a discretization method for semi-infinite programming
- On Linear Semi-Infinite Programming Problems: An Algorithm
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Local Convergence of SQP Methods in Semi-Infinite Programming
- A Regularized Explicit Exchange Method for Semi-Infinite Programs with an Infinite Number of Conic Constraints
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- Semi-infinite programming. Recent advances
This page was built for publication: Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints
