A semi-smooth Newton method for solving convex quadratic programming problem under simplicial cone constraint (original) (raw)

Quadratic convergence of a smoothing Newton method for symmetric cone programming without strict complementarity

Lingchen Kong

Positivity, 2000

View PDFchevron_right

Global convergence of an inexact interior-point method for convex quadratic symmetric cone programming

Maryam Zangiabadi

Bulletin of The Iranian Mathematical Society, 2016

View PDFchevron_right

A Newton-Type Method for Convex Quadratic Programming

Vasile Moraru

View PDFchevron_right

The Q Method for Symmetric Cone Programming

Farid Alizadeh

Journal of Optimization Theory and Applications, 2011

View PDFchevron_right

Cones of Matrices and Successive Convex Relaxations of Nonconvex Sets

Masakazu Kojima

SIAM Journal on Optimization, 2000

View PDFchevron_right

Minimizing quadratic functions over non-negative cone with the rate of convergence and finite termination

Zdeněk Dostál

2005

View PDFchevron_right

Second order cone programming relaxation of nonconvex quadratic optimization problems

Masakazu Kojima

Optimization Methods and Software, 2001

View PDFchevron_right

A Quadratically Constrained Quadratic Optimization Model for Completely Positive Cone Programming

Masakazu Kojima

SIAM Journal on Optimization, 2013

View PDFchevron_right

A Proximal Multiplier Method for Convex Separable Symmetric Cone Optimization

ERIK ALEX PAPA QUIROZ

Proceedings of the 2020 5th International Conference on Multimedia Systems and Signal Processing, 2020

View PDFchevron_right

The method for second order cone programming

Farid Alizadeh

Computers & Operations Research, 2008

View PDFchevron_right

Second-order cone programming

Farid Alizadeh

Mathematical Programming, 2003

View PDFchevron_right

An exterior Newton method for strictly convex quadratic programming

James Liu

2000

View PDFchevron_right

Implementation of nonsymmetric interior-point methods for linear optimization over sparse matrix cones

Joachim Dahl, Martin Andersen

Mathematical Programming Computation, 2010

View PDFchevron_right

Interior-point methods for large-scale cone programming

Joachim Dahl, Zhang Liu

View PDFchevron_right

A least-square semismooth Newton method for the second-order cone complementarity problem

Jein-Shan Chen

Optimization Methods and Software, 2011

View PDFchevron_right

On the minimum-norm solution of convex quadratic programming

Hossein Moosaei

2021

View PDFchevron_right

A Different Approach to Cone-Convex Optimization

Meetu Bhatia Grover

2013

View PDFchevron_right

Primal-dual first-order methods with {\mathcal {O}(1/\epsilon)}$$ iteration-complexity for cone programming

Renato Monteiro

Mathematical Programming, 2011

View PDFchevron_right

Polynomial convergence of primal-dual algorithms for the second-order cone program based on the MZ-family of directions

Takashi Tsuchiya, Renato Monteiro

Mathematical Programming, 2000

View PDFchevron_right

Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints

Lijie Bai

Optimization Letters, 2014

View PDFchevron_right

A Dual Method For Solving General Convex Quadratic Programs

Brahmi Belkacem

2009

View PDFchevron_right

A proximal point algorithm for the monotone second-order cone complementarity problem

Jein-Shan Chen

Computational Optimization and Applications, 2012

View PDFchevron_right

An unconstrained smooth minimization reformulation of the second-order cone complementarity problem

Paul Tseng, Jein-Shan Chen

Mathematical Programming, 2005

View PDFchevron_right

A Polynomial Primal-Dual Path-Following Algorithm for Second-order Cone Programming

Takashi Tsuchiya

View PDFchevron_right

An interior-exterior approach for convex quadratic programming

Safae el haj ben ali

Applied Numerical Mathematics, 2011

View PDFchevron_right

On polyhedral and second-order cone decompositions of semidefinite optimization problems

Dimitris Bertsimas

Operations Research Letters, 2020

View PDFchevron_right

On convex quadratic programs with linear complementarity constraints

Lijie Bai

Computational Optimization and Applications, 2012

View PDFchevron_right

A proximal gradient descent method for the extended second-order cone linear complementarity problem

Jein-Shan Chen

Journal of Mathematical Analysis and Applications, 2010

View PDFchevron_right

A full Nesterov-Todd step infeasible interior-point algorithm for symmetric cone linear complementarity problem

Nezam Mahdavi-Amiri

2014

View PDFchevron_right

Decomposition for structured convex programs with smooth multiplier methods

Abdelouahed Hamdi

Applied Mathematics and Computation, 2005

View PDFchevron_right

Global Convergence of Algorithms Under Constant Rank Conditions for Nonlinear Second-Order Cone Programming

Roberto Andreani

Journal of Optimization Theory and Applications

View PDFchevron_right

Linear matrix inequalities with chordal sparsity patterns and applications to robust quadratic optimization

Martin Andersen, Joachim Dahl

2010

View PDFchevron_right

A note on the strong polynomiality of convex quadratic programming

SUSHIL K VERMA

Mathematical Programming, 1995

View PDFchevron_right

A note on set-semidefinite relaxations of nonconvex quadratic programs

Faizan Ahmed

Journal of Global Optimization, 2012

View PDFchevron_right

A class of column generation/simplicial decomposition methods in convex differentiable optimization, I: Convergence analysis

Michael Patriksson

2003

View PDFchevron_right