object

phase1_sub_problem(Problem,StartPoint)

  • Problem - The original constrained problem.

  • StartPoint - The point log_barrier(_,_) was actually given (Problem’s own initial_point/1); phase 1 starts its search from here.

Internal phase-1 feasibility subproblem for log_barrier(_,_): minimizes sum_j max(0, h_j(x) + margin)^2 (margin = 1.0e-6), an ordinary smooth, everywhere-defined unconstrained objective, so a minimizer that reaches (near) zero gives a point with every h_j(x) < -margin, comfortably inside the barrier’s domain rather than exactly on its boundary. Instantiated once, when initial_point/1 is not already strictly feasible; not meant to be used directly. See log_barrier(_,_)’s “ensure_strictly_feasible/3” for how the result is validated and how this heuristic falls back to raising domain_error/2 when it does not succeed.

Availability:
logtalk_load(constrained_optimization(loader))
Author: Paulo Moura
Version: 1:0:0
Date: 2026-09-03
Compilation flags:
static, context_switching_calls
Implements:
public local_optimization_problem_protocol
Uses:
linear_algebra
Remarks:
(none)
Inherited public predicates:
 gradient/2  hessian/2  initial_point/1  objective/2  position_bounds/1  progress/5  stop_condition/3

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)