A feasible direction algorithm for nonlinear second-order cone programs
From MaRDI portal
Publication:5238072
DOI10.1080/10556788.2018.1506452zbMath1431.90146OpenAlexW2889782865MaRDI QIDQ5238072
Alfredo Canelas, Julio López, Miguel Carrasco
Publication date: 28 October 2019
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/10556788.2018.1506452
Related Items (5)
The rate of convergence of proximal method of multipliers for second-order cone optimization problems ⋮ A line search penalty-free method for nonlinear second-order cone programming ⋮ DC semidefinite programming and cone constrained DC optimization. I: Theory ⋮ A Barzilai and Borwein regularization feasible direction algorithm for convex nonlinear SOC programming with linear constraints ⋮ Profit-based churn prediction based on minimax probability machines
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A feasible directions algorithm for nonlinear complementarity problems and applications in mechanics
- A feasible directions method for nonsmooth convex optimization
- An interior point technique for solving bilevel programming problems
- Globally convergent cutting plane method for nonconvex nonsmooth minimization
- Analysis of nonsmooth vector-valued functions associated with second-order cones.
- Alternative second-order cone programming formulations for support vector classification
- Convergence analysis of the augmented Lagrangian method for nonlinear second-order cone optimization problems
- Convergence of the augmented Lagrangian method for nonlinear optimization problems over second-order cones
- Applications of second-order cone programming
- Feasible direction interior-point technique for nonlinear optimization
- An interior-point algorithm for nonconvex nonlinear programming
- Second-order cone programming
- Solving problems with semidefinite and related constraints using interior-point methods for nonlinear programming
- Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions
- 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 proximal algorithm with variable metric for second-order cone programming: applications to structural optimization and support vector machines
- A primal–dual interior point method for nonlinear optimization over second-order cones
- A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- 10.1162/153244303321897726
- Differentiable Exact Penalty Functions for Nonlinear Second-Order Cone Programs
- On the Local Convergence of Semismooth Newton Methods for Linear and Nonlinear Second-Order Cone Programs Without Strict Complementarity
- An Active-Set Method for Second-Order Conic-Constrained Quadratic Programming
This page was built for publication: A feasible direction algorithm for nonlinear second-order cone programs
