Logarithmic Barrier Method Via Minorant Function for Linear Semidefinite Programming

We propose in this study, a new logarithmic barrier approach to solve linear semidefinite programming problem. We are interested in computation of the direction by Newton’s method and of the displacement step using minorant functions instead of line search methods in order to reduce the computation...

Full description

Bibliographic Details
Published in:	Annales Mathematicae Silesianae
Main Author:	Leulmi Assma
Format:	Article
Language:	English
Published:	Sciendo 2023-03-01
Subjects:	linear semidefinite programming barrier methods line search 90c22 90c51
Online Access:	https://doi.org/10.2478/amsil-2022-0021

Similar Items

Subsampling algorithms for semidefinite programming
by: Alexandre W. d'Aspremont
Published: (2011-01-01)

A new distributionally robust reward-risk model for portfolio optimization
by: Zhou Yijia, et al.
Published: (2024-05-01)

Mobility offer allocations in corporate settings
by: Sebastian Knopp, et al.
Published: (2021-01-01)

The exactness of the ℓ1 penalty function for a class of mathematical programs with generalized complementarity constraints
by: Yukuan Hu, et al.
Published: (2024-11-01)

Efficient Positive Semidefinite Matrix Approximation by Iterative Optimisations and Gradient Descent Method
by: Vali Asimit, et al.
Published: (2025-02-01)

Pareto front approximation through a multi-objective augmented Lagrangian method
by: Guido Cocchi, et al.
Published: (2021-01-01)

Stochastic optimization of level-dependent perishable inventory system by Jackson network
by: Md. Amirul Islam, et al.
Published: (2023-04-01)

THE GROTHENDIECK CONSTANT IS STRICTLY SMALLER THAN KRIVINE’S BOUND
by: MARK BRAVERMAN, et al.
Published: (2013-01-01)

A Reduced Semidefinite Programming Formulation for HA Assignment Problems in Sport Scheduling
by: Hugo José Lara, et al.
Published: (2018-12-01)

Vector optimization problems with weakened convex and weakened affine constraints in linear topological spaces
by: Zeng Renying
Published: (2024-10-01)

Characterizations of the Solution Sets of Generalized Convex Fuzzy Optimization Problem
by: Chen Wang, et al.
Published: (2019-03-01)

HBSP: a hybrid bilinear and semidefinite programming approach for aligning partially overlapping point clouds
by: Wei Lian, et al.
Published: (2024-12-01)

On quasi-solution to infeasible linear complementarity problem obtained by Lemke’s method
by: Popov L.
Published: (2004-03-01)

A convergent hybrid three-term conjugate gradient method with sufficient descent property for unconstrained optimization
by: Diphofu T., et al.
Published: (2022-06-01)

Robust Invariance Conditions of Uncertain Linear Discrete Time Systems Based on Semidefinite Programming Duality
by: Hongli Yang, et al.
Published: (2024-08-01)

State estimation of DC microgrids using manifold optimization and semidefinite programming
by: Oscar Danilo Montoya, et al.
Published: (2024-12-01)

A Sum-of-Squares and Semidefinite Programming Approach for Maximum Likelihood DOA Estimation
by: Shu Cai, et al.
Published: (2016-12-01)

ON THE COMPLEXITY OF SEMIDEFINITE PROGRAMS ARISING IN POLYNOMIAL OPTIMIZATION
by: Igor Klep, et al.
Published: (2012-12-01)

High-speed batch processing of semidefinite programs with feedforward neural networks
by: Tamás Kriváchy, et al.
Published: (2021-01-01)

Semidefinite Multiobjective Mathematical Programming Problems with Vanishing Constraints Using Convexificators
by: Kin Keung Lai, et al.
Published: (2021-12-01)

A class of singular Ro-matrices and extensions to semidefinite linear complementarity problems
by: Sivakumar K.C.
Published: (2013-01-01)

Comparative numerical study between line search methods and majorant functions in barrier logarithmic methods for linear programming
by: Soraya Chaghoub, et al.
Published: (2020-09-01)

Comparative numerical study between line search methods and majorant functions in barrier logarithmic methods for linear programming
by: Soraya Chaghoub, et al.
Published: (2020-09-01)

Comparative numerical study between line search methods and majorant functions in barrier logarithmic methods for linear programming
by: Soraya Chaghoub, et al.
Published: (2020-09-01)

A Semidefinite Programming Approach for Harmonic Balance Method
by: Cheng H. Yang, et al.
Published: (2019-01-01)

Day-Ahead Coordinated Reactive Power Optimization Dispatching Based on Semidefinite Programming
by: Binbin Xu, et al.
Published: (2025-10-01)

Outcome space range reduction method for global optimization of sum of affine ratios problem
by: Jiao Hongwei, et al.
Published: (2016-01-01)

An Iterative Method for Symmetric Positive Semidefinite Linear System of Equations
by: Salkuyeh Davod Khojasteh
Published: (2014-06-01)

Uncooperative Emitter Localization Based on Joint Sensor Selection and Semidefinite Programming
by: L. Cao, et al.
Published: (2022-12-01)

Automatic boomerang attacks search on Rijndael
by: Rouquette Loïc, et al.
Published: (2024-02-01)

Exact Optimal Designs of Experiments for Factorial Models via Mixed-Integer Semidefinite Programming
by: Belmiro P. M. Duarte
Published: (2023-02-01)

New error bounds for linear complementarity problems of Σ-SDD matrices and SB-matrices
by: Hou Zhiwu, et al.
Published: (2019-12-01)

Optimal Net Load Flattening in Unbalanced Distribution Systems via Rank-Penalized Semidefinite Programming
by: Ibrahim Alsaleh, et al.
Published: (2023-01-01)

Complexity analysis of primal-dual algorithms for the semidefinite linear complementarity problem
by: Mohamed Achache, et al.
Published: (2011-08-01)

LIGHTWEIGHT DESIGN OF STRUCTURES BASED ON A SEMIDEFINITE PROGRAMMING METHOD (MT)
by: WANG XingFeng, et al.
Published: (2022-01-01)

Semidefinite programming for manipulating acoustic traps in real time (SMART)
by: Sebastian Zehnter, et al.
Published: (2025-05-01)

Matching ontologies with kernel principle component analysis and evolutionary algorithm
by: Xue Xingsi, et al.
Published: (2024-08-01)

Constant modulus shaped beam synthesis via linear fractional semidefinite relaxation
by: Xiuquan Dou, et al.
Published: (2022-09-01)

Constraint Qualifications and Optimality Conditions for Nonsmooth Semidefinite Multiobjective Programming Problems with Mixed Constraints Using Convexificators
by: Balendu Bhooshan Upadhyay, et al.
Published: (2024-10-01)

Optimal Micro-PMU Placement for Improving State Estimation Accuracy via Mixed-integer Semidefinite Programming
by: Yang Peng, et al.
Published: (2023-01-01)