object

primal_dual_interior_point(Problem)

• Problem - Problem object implementing constrained_optimization_problem_protocol and defining gradient/2.

Infeasible-start primal-dual interior-point method with Mehrotra predictor-corrector for general equality, inequality, and box constraints.

Availability:

logtalk_load(constrained_optimization(loader))

Author: Paulo Moura

Version: 1:0:0

Date: 2026-09-04

Compilation flags:

static, context_switching_calls

Imports:

public constrained_optimization_solver

public local_optimization_solver(Problem)

Uses:

linear_algebra

list

Remarks:

(none)

Inherited public predicates:

 check_option/1  check_options/1  default_option/1  default_options/1  option/2  option/3  run/2  run/3  run/4  valid_option/1  valid_options/1

Public predicates

(no local declarations; see entity ancestors if any)

Protected predicates

(no local declarations; see entity ancestors if any)

Private predicates

(no local declarations; see entity ancestors if any)

Operators

(none)

See also

constrained_optimization_problem_protocol, sqp_active_set(Problem), log_barrier(Problem,InnerSolver), local_optimization_solver(Problem), linear_algebra