Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case
From MaRDI portal
Publication:2399192
DOI10.1007/S10915-015-0149-6zbMATH Open1369.90167OpenAlexW2255377052MaRDI QIDQ2399192FDOQ2399192
Authors: Shunsuke Hayashi, Soon-Yi Wu, Liping Zhang 
Publication date: 22 August 2017
Published in: Journal of Scientific Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10915-015-0149-6
Recommendations
- An explicit exchange algorithm for linear semi-infinite programming problems with second-order cone constraints
- Convergent Algorithms for a Class of Convex Semi-infinite Programs
- A regularized explicit exchange method for semi-infinite programs with an infinite number of conic constraints
- Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints
- Second-order cone programming
Nonlinear programming (90C30) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Title not available (Why is that?)
- Robust optimization
- Title not available (Why is that?)
- Applications of second-order cone programming
- Robust solutions of uncertain linear programs
- Semi-infinite programming. Workshop, Cottbus, Germany, September 1996
- Semi-Infinite Programming: Theory, Methods, and Applications
- Semi-infinite programming
- Complementarity functions and numerical experiments on some smoothing Newton methods for second-order-cone complementarity problems
- Robust convex optimization
- Smoothing functions for second-order-cone complementarity problems
- Title not available (Why is that?)
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- Title not available (Why is that?)
- A smoothing Newton method with Fischer-Burmeister function for second-order cone complementarity problems
- Semismooth Newton methods for solving semi-infinite programming problems
- A smoothing Newton method for semi-infinite programming
- Solving convex programs with infinitely many linear constraints by a relaxed cutting plane method
- A new exchange method for convex semi-infinite programming
- An iterative method for solving KKT system of the semi-infinite programming
- A Central Cutting Plane Algorithm for Convex Semi-Infinite Programming Problems
- Discretization in semi-infinite programming: the rate of convergence
- An SQP-type algorithm for nonlinear second-order cone programs
- Perturbation analysis of second-order cone programming problems
- A primal–dual interior point method for nonlinear optimization over second-order cones
- Solving Semi-Infinite Optimization Problems with Interior Point Techniques
- Recent advances in numerical methods for nonlinear equations and nonlinear least squares
- A trust region algorithm for Nash equilibrium problems
- An improved algorithm for optimization problems with functional inequality constraints
- A matrix-splitting method for symmetric affine second-order cone complementarity problems
- On Linear Semi-Infinite Programming Problems: An Algorithm
- Linear semi-infinite programming theory: an updated survey
- RCMARS: robustification of CMARS with different scenarios under polyhedral uncertainty set
- Penalty and smoothing methods for convex semi-infinite programming
- An explicit exchange algorithm for linear semi-infinite programming problems with second-order cone constraints
- A regularized explicit exchange method for semi-infinite programs with an infinite number of conic constraints
- An Unconstrained Convex Programming Approach to Linear Semi-Infinite Programming
Cited In (4)
- Local reduction based SQP-type method for semi-infinite programs with an infinite number of second-order cone constraints
- A modified exchange algorithm for distributional robust optimization and applications in risk management
- An explicit exchange algorithm for linear semi-infinite programming problems with second-order cone constraints
- A regularized explicit exchange method for semi-infinite programs with an infinite number of conic constraints
This page was built for publication: Computation algorithm for convex semi-infinite program with second-order cones: special analyses for affine and quadratic case
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2399192)
