import autograd.numpy as np
import numpy


from pymanopt import Problem
from pymanopt.manifolds import Sphere, Product, Oblique
from pymanopt.solvers import ConjugateGradient

def cost2(M,N,P):
  W =  np.abs((M-N)*(N-P)*(P-M))
  return W

def emax():
  manifold = Oblique(2,50)
  solver = ConjugateGradient(mingradnorm=8e-12, minstepsize=1e-9,maxiter=35)
  def cost(X):
   Z = X*X
   a = np.array([[[cost2(Z[0,i],Z[0,j],Z[0,k]) for i in range(50)] for j in range(50)] for k in range(50)])
   S = -sum(sum(sum(a)))
   return S
  problem=Problem(manifold,cost)
  return solver.solve(problem)

emax();