A line search penalty-free method for nonlinear second-order cone programming
From MaRDI portal
Publication:829562
DOI10.1007/S10440-020-00334-WzbMATH Open1467.90033OpenAlexW3049167638MaRDI QIDQ829562FDOQ829562
Authors: Qi Zhao, Zhongwen Chen 
Publication date: 6 May 2021
Published in: Acta Applicandae Mathematicae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10440-020-00334-w
Recommendations
- A penalty-function-free line search SQP method for nonlinear programming
- Differentiable exact penalty functions for nonlinear second-order cone programs
- \(\mathrm S l_1\)QP based algorithm with trust region technique for solving nonlinear second-order cone programming problems
- A line search exact penalty method for nonlinear semidefinite programming
- An SQP-type algorithm for nonlinear second-order cone programs
Cites Work
- PENNON: A code for convex nonlinear and semidefinite programming
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Trust Region Methods
- Applications of second-order cone programming
- Second-order cone programming
- On the implementation and usage of SDPT3 -- a Matlab software package for semidefinite-quadratic-linear programming, version 4.0
- 10.1162/153244303321897726
- A trust region SQP-filter method for nonlinear second-order cone programming
- A Combined Smoothing and Regularization Method for Monotone Second-Order Cone Complementarity Problems
- Global and local convergence of a penalty-free method for nonlinear programming
- Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence
- A line search exact penalty method using steering rules
- A filter method with unified step computation for nonlinear optimization
- Convergence of the augmented Lagrangian method for nonlinear optimization problems over second-order cones
- 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
- 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
- Interior proximal algorithm with variable metric for second-order cone programming: applications to structural optimization and support vector machines
- A class of nonlinear Lagrangians for nonconvex second order cone programming
- A homotopy method for nonlinear second-order cone programming
- \(\mathrm S l_1\)QP based algorithm with trust region technique for solving nonlinear second-order cone programming problems
- A feasible direction algorithm for nonlinear second-order cone programs
Cited In (4)
- An approximate lower order penalty approach for solving second-order cone linear complementarity problems
- \(\mathrm S l_1\)QP based algorithm with trust region technique for solving nonlinear second-order cone programming problems
- Differentiable exact penalty functions for nonlinear second-order cone programs
- A penalty-free-type two-step linear search algorithm
Uses Software
This page was built for publication: A line search penalty-free method for nonlinear second-order cone programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q829562)
