On the public citation graph
Some properties of the Hessian of the logarithmic barrier function
0 signed · 61 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/bf00932477openalex-snapshot
Analytical expressions for the eigenvalues and eigenvectors of the Hessian matrices of barrier and penalty functions
inferredcites →https://doi.org/10.1007/bf02579150openalex-snapshot
A new polynomial-time algorithm for linear programming
inferredcites →https://doi.org/10.1007/bf02592223openalex-snapshot
A note on the computation of an orthonormal basis for the null space of a matrix
inferredcites →https://doi.org/10.1016/0378-4754(88)90129-2openalex-snapshot
Practical methods of optimization
inferredcites →https://doi.org/10.1016/0378-4754(91)90038-5openalex-snapshot
Matrix perturbation theory
inferredcites →https://doi.org/10.1017/s0962492900002300openalex-snapshot
Interior methods for constrained optimization
inferredcites →https://doi.org/10.1057/jors.1980.193openalex-snapshot
Operations Research Support Methodology
inferredcites →https://doi.org/10.1057/jors.1992.12openalex-snapshot
Numerical Linear Algebra and Optimization: Volume 1
inferredcites →https://doi.org/10.1093/comjnl/12.3.207-aopenalex-snapshot
Nonlinear Programming--Sequential Unconstrained Minimization Techniques
inferredcites →https://doi.org/10.1093/oso/9780198535645.003.0010openalex-snapshot
Analysis of the Cholesky decomposition of a semi-definite matrix
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
inferredcites →https://doi.org/10.1137/0911064openalex-snapshot
A New Modified Cholesky Factorization
inferredcites →https://doi.org/10.1137/1.9781611971200openalex-snapshot
Numerical Methods for Unconstrained Optimization and Nonlinear Equations
inferredcites →https://doi.org/10.1137/1034048openalex-snapshot
Path-Following Methods for Linear Programming
inferredcites →https://doi.org/10.1287/ijoc.5.1.40openalex-snapshot
A Barrier Method for Large-Scale Constrained Optimization
inferredcites →https://doi.org/10.2172/1453943openalex-snapshot
Numerical Methods for Nonlinearly Constrained Optimization
inferredcites →https://doi.org/10.2172/7333261openalex-snapshot
Numerical methods for nonlinearly constrained optimization
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/0-387-30528-9openalex-snapshot
Global optimization : from theory to implementation
inferred← citeshttps://doi.org/10.1007/0-387-30528-9_7openalex-snapshot
Disciplined Convex Programming
inferred← citeshttps://doi.org/10.1007/978-1-4613-3279-4_23openalex-snapshot
The interior-point revolution in constrained optimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-3335-7_10openalex-snapshot
Combining Trust Region and Affine Scaling for Linearly Constrained Nonconvex Minimization
inferred← citeshttps://doi.org/10.1007/978-1-4613-3335-7_2openalex-snapshot
A Primal-dual Interior Method for Nonconvex Nonlinear Programming
inferred← citeshttps://doi.org/10.1007/pl00011421openalex-snapshot
On the convergence of the Newton/log-barrier method
inferred← citeshttps://doi.org/10.1007/s10107-002-0360-8openalex-snapshot
An augmented Lagrangian interior-point method using directions of negative curvature
inferred← citeshttps://doi.org/10.1007/s10589-006-9008-6openalex-snapshot
Detecting “dense” columns in interior point methods for linear programs
inferred← citeshttps://doi.org/10.1007/s10957-017-1137-9openalex-snapshot
Using Improved Directions of Negative Curvature for the Solution of Bound-Constrained Nonconvex Problems
inferred← citeshttps://doi.org/10.1016/j.camwa.2005.08.016openalex-snapshot
The cholesky factorization in interior point methods
inferred← citeshttps://doi.org/10.1016/j.ijepes.2014.08.015openalex-snapshot
An optimal power flow based on safety barrier interior point method
inferred← citeshttps://doi.org/10.1023/a:1013665605315openalex-snapshot
Local Behavior of the Newton Method on Two Equivalent Systems from Linear Programming
inferred← citeshttps://doi.org/10.1023/b:jota.0000037601.54325.3dopenalex-snapshot
Sphere of Convergence of Newton's Method on Two Equivalent Systems from Nonlinear Programming
inferred← citeshttps://doi.org/10.1080/01630563.2017.1338732openalex-snapshot
Algorithm of Barrier Objective Penalty Function
inferred← citeshttps://doi.org/10.1090/s0273-0979-04-01040-7openalex-snapshot
The interior-point revolution in optimization: History, recent developments, and lasting consequences
inferred← citeshttps://doi.org/10.1109/glocom.2003.1258662openalex-snapshot
Minimizing the peak-to-average power ratio of OFDM signals via convex optimization
inferred← citeshttps://doi.org/10.1109/ias.2000.882612openalex-snapshot
Power factor correction and harmonic mitigation in industry
inferred← citeshttps://doi.org/10.1109/icc.2005.1494686openalex-snapshot
A convex interior-point method for optimal OFDM PAR reduction
inferred← citeshttps://doi.org/10.1109/jstars.2013.2266732openalex-snapshot
Fast Constrained Least Squares Spectral Unmixing Using Primal-Dual Interior-Point Optimization
inferred← citeshttps://doi.org/10.1109/tsp.2006.875390openalex-snapshot
Minimizing the Peak-to-Average Power Ratio of OFDM Signals Using Convex Optimization
inferred← citeshttps://doi.org/10.1137/050633354openalex-snapshot
On Numerical Issues of Interior Point Methods
inferred← citeshttps://doi.org/10.1137/0805001openalex-snapshot
Why a Pure Primal Newton Barrier Step May be Infeasible
inferred← citeshttps://doi.org/10.1137/120890600openalex-snapshot
Bounds on Eigenvalues of Matrices Arising from Interior-Point Methods
inferred← citeshttps://doi.org/10.1137/s0036144502414942openalex-snapshot
Interior Methods for Nonlinear Optimization
inferred← citeshttps://doi.org/10.1137/s0895479894270658openalex-snapshot
Stability of Symmetric Ill-Conditioned Systems Arising in Interior Methods for Constrained Optimization
inferred← citeshttps://doi.org/10.1137/s0895479895285135openalex-snapshot
On the Least Squares Approximation of Symmetric-Definite Pencils Subject to Generalized Spectral Constraints
inferred← citeshttps://doi.org/10.1137/s1052623496304712openalex-snapshot
Modified Cholesky Factorizations in Interior-Point Algorithms for Linear Programming
inferred← citeshttps://doi.org/10.1137/s1052623496305560openalex-snapshot
Primal-Dual Interior Methods for Nonconvex Nonlinear Programming
inferred← citeshttps://doi.org/10.1137/s1052623497322279openalex-snapshot
Ill-Conditioning and Computational Error in Interior Methods for Nonlinear Programming
inferred← citeshttps://doi.org/10.1137/s1052623497330148openalex-snapshot
A Primal-Dual Method for Large-Scale Image Reconstruction in Emission Tomography
inferred← citeshttps://doi.org/10.11606/d.18.2007.tde-14032008-155744openalex-snapshot
O método da função Lagrangiana barreira modificada/penalidade
inferred← citeshttps://doi.org/10.11606/t.18.2006.tde-18082006-115009openalex-snapshot
Resolução do problema de fluxo de potência ótimo reativo via método da função lagrangiana barreira modificada
inferred← citeshttps://doi.org/10.1287/moor.27.3.585.312openalex-snapshot
Properties of the Log-Barrier Function on Degenerate Nonlinear Programs
inferred← citeshttps://doi.org/10.14288/1.0051537openalex-snapshot
New probabilistic inference algorithms that harness the strengths of variational and Monte Carlo methods
inferred← citeshttps://doi.org/10.2478/cmam-2003-0011openalex-snapshot
Applications of Primal-dual Interior Methods in Structural Optimization
inferred← citeshttps://doi.org/10.3166/ts.30.35-59openalex-snapshot
Algorithme primal-dual de points intérieurs pour l’estimation pénalisée des cartes d’abondances en imagerie hyperspectrale
inferred← citeshttps://doi.org/10.48550/arxiv.2102.13068openalex-snapshot
Truncated Log-concave Sampling with Reflective Hamiltonian Monte Carlo
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.