Related Experiment Video
Updated: Feb 27, 2026

Computation of Atmospheric Concentrations of Molecular Clusters from ab initio Thermochemistry
Published on: April 8, 2020
A globally convergent QP-free algorithm for nonlinear semidefinite programming
Jian-Ling Li1, Zhen-Ping Yang1, Jin-Bao Jian2
1College of Mathematics and Information Science, Guangxi University, Daxue Road 100, Nanning, Guangxi 530004 China.
Abstract:
In this paper, we present a QP-free algorithm for nonlinear semidefinite programming. At each iteration, the search direction is yielded by solving two systems of linear equations with the same coefficient matrix; [Formula: see text] penalty function is used as merit function for line search, the step size is determined by Armijo type inexact line search. The global convergence of the proposed algorithm is shown under suitable conditions. Preliminary numerical results are reported.
Related Concept Videos
Application of Nonlinear Inequalities
Mechanistic Models: Compartment Models in Algorithms for Numerical Problem Solving
In individual population analyses, different algorithms are employed, such as Cauchy's method, which uses a...
Gaussian Elimination: Problem Solving
Introduction to Nonlinear Inequalities
Statically Indeterminate Problem Solving
Quadratic Models