An exterior point polynomial-time algorithm for convex quadratic programming (Q2340489): Difference between revisions

From MaRDI portal

Jump to:navigation, search

Latest revision as of 02:15, 18 December 2024

scientific article

Language	Label	Description	Also known as
English	An exterior point polynomial-time algorithm for convex quadratic programming	scientific article

Statements

scholarly article

0 references

An exterior point polynomial-time algorithm for convex quadratic programming (English)

0 references

Computational Optimization and Applications

0 references

publication date

20 April 2015

0 references

zbMATH Keywords

self-concordant function

0 references

polynomial-time algorithm

0 references

exterior point

0 references

path-following

0 references

convex quadratic programming

0 references

regularization

0 references

0 references

describes a project that uses

0 references

NETLIB LP Test Set

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10589-014-9710-8

0 references

A new polynomial-time algorithm for linear programming

0 references

An \(O(n^ 3 L)\) primal-dual potential reduction algorithm for solving convex quadratic programs

0 references

An extension of Karmarkar's projective algorithm for convex quadratic programming

0 references

An \(O(n^ 3L)\) primal interior point algorithm for convex quadratic programming

0 references

Interior path following primal-dual algorithms. II: Convex quadratic programming

0 references

0 references

Interior path following primal-dual algorithms. I: Linear programming

0 references

An Algorithm for Convex Quadratic Programming That Requires <i>O</i>(<i>n</i><sup>3.5</sup><i>L</i>) Arithmetic Operations

0 references

On the convergence of the method of analytic centers when applied to convex quadratic programs

0 references

A polynomial-time algorithm, based on Newton's method, for linear programming

0 references

A new primal-dual path-following method for convex quadratic programming

0 references

Convergence analysis of an inexact potential reduction method for convex quadratic programming

0 references

A polynomial arc-search interior-point algorithm for convex quadratic programming

0 references

A predictor-corrector algorithm with multiple corrections for convex quadratic programming

0 references

Adaptive constraint reduction for convex quadratic programming

0 references

Regularized symmetric indefinite systems in interior point methods for linear and quadratic optimization

0 references

A primal-dual regularized interior-point method for convex quadratic programs

0 references

An entire space polynomial-time algorithm for linear programming

0 references

An unconstrained convex programming approach to solving convex quadratic programming problems

0 references

Perturbing the dual feasible region for solving convex quadratic programs

0 references

Exterior point algorithms for nearest points and convex quadratic programs

0 references

A new penalty function algorithm for convex quadratic programming

0 references

A Primal-Dual Exterior Point Method for Nonlinear Optimization

0 references

An interior-exterior approach for convex quadratic programming

0 references

A Globally and Superlinearly Convergent Algorithm for Convex Quadratic Programs with Simple Bbounds

0 references

A Finite Continuation Algorithm for Bound Constrained Quadratic Programming

0 references

An exterior Newton method for strictly convex quadratic programming

0 references

A non-interior path following method for convex quadratic programming problems with bound constraints

0 references

A numerically stable dual method for solving strictly convex quadratic programs

0 references

0 references

QPSchur: A dual, active-set, Schur-complement method for large-scale and structured convex quadratic programming

0 references

A globally convergent primal-dual active-set framework for large-scale convex quadratic optimization

0 references

A non-interior predictor-corrector path following algorithm for the monotone linear complementarity problem

0 references

A Globally and Locally Superlinearly Convergent Non--Interior-Point Algorithm for P<sub>0</sub>LCPs

0 references

Global convergence of a class of non-interior point algorithms using Chen-Harker-Kanzow-Smale functions for nonlinear complementarity problems

0 references

0 references

The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform \(P\)-functions

0 references

A Global Linear and Local Quadratic Noninterior Continuation Method for Nonlinear Complementarity Problems Based on Chen--Mangasarian Smoothing Functions

0 references

A global linear and local quadratic continuation smoothing method for variational inequalities with box constraints

0 references

Complexity of a noninterior path-following method for the linear complementarity problem

0 references

Robust Statistics

0 references

A complexity analysis of a smoothing method using CHKS-functions for monotone linear complementarity problems

0 references

Application of a Smoothing Technique to Decomposition in Convex Optimization

0 references

Interior-point Lagrangian decomposition method for separable convex optimization

0 references

An Inexact Perturbed Path-Following Method for Lagrangian Decomposition in Large-Scale Separable Convex Optimization

0 references

Path-following gradient-based decomposition algorithms for separable convex optimization

0 references

Nonlinear rescaling vs. smoothing technique in convex optimization

0 references

0 references

A special newton-type optimization method

0 references

On the entropic perturbation and exponential penalty methods for linear programming

0 references

Primal and dual convergence of a proximal point exponential penalty method for linear programming

0 references

Modified barrier functions (theory and methods)

0 references

On the convergence of the exponential multiplier method for convex programming

0 references

Nonlinear rescaling and proximal-like methods in convex optimization

0 references

Primal-dual nonlinear rescaling method for convex optimization

0 references

Primal–dual exterior point method for convex optimization

0 references

1.5-\(Q\)-superlinear convergence of an exterior-point method for constrained optimization

0 references

Primal-dual nonlinear rescaling method with dynamic scaling parameter update

0 references

The Newton modified barrier method for QP problems

0 references

Nonlinear programming without a penalty function or a filter

0 references

Erratum to: ``Nonlinear programming without a penalty function or a filter''

0 references

A new bound for the quadratic assignment problem based on convex quadratic programming

0 references

0 references

0 references

A Mathematical View of Interior-Point Methods in Convex Optimization

0 references

0 references

0 references

Khachiyan’s algorithm for linear programming

0 references

Remark on the Constraint Sets in Linear Programming

0 references

A repository of convex quadratic programming problems

0 references

Symmetric Quasidefinite Matrices

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1007/S10589-014-9710-8

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2340489

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2340489&oldid=39019678"